Last visit was: 08 Nov 2024, 05:45 It is currently 08 Nov 2024, 05:45

Close

GRE Prep Club Daily Prep

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GRE score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Close

Request Expert Reply

Confirm Cancel
avatar
Intern
Intern
Joined: 16 Jan 2021
Posts: 5
Own Kudos [?]: 8 [2]
Given Kudos: 0
Send PM
Retired Moderator
Joined: 16 Apr 2020
Status:Founder & Quant Trainer
Affiliations: Prepster Education
Posts: 1546
Own Kudos [?]: 3216 [1]
Given Kudos: 172
Location: India
WE:Education (Education)
Send PM
Intern
Intern
Joined: 04 May 2021
Posts: 6
Own Kudos [?]: 1 [0]
Given Kudos: 18
Send PM
Manager
Manager
Joined: 19 Feb 2021
Posts: 183
Own Kudos [?]: 178 [0]
Given Kudos: 425
GRE 1: Q170 V170
Send PM
Re: How many points (r, s) can be formed so that r < s, and that the x and [#permalink]
Nice question!
First calculate the number of odd integers between 1 and 399 inclusive that comes up to 200 because the number of the even and odd integers are equal in quantity.
So the total number of integers to chose from is 200.
Now r<s this condition restricts the result:
What we can do is to choose r and then select s:
so r can be selected in 1 way for example 1 then s can selected in 199 ways from 3 to 399.
Similarly we can select r as 3 the number of ways of doing so is also 1 but the number of ways that s can be selected is now 198.
So the series becomes:
(1*199) + (1*198) + (1*197) + .... + (1*1)
We can calculate the sum of this series as [(1+199)/2] * 199 = 19900.
So the answer is 19900.
Senior Manager
Senior Manager
Joined: 23 Jan 2021
Posts: 294
Own Kudos [?]: 170 [0]
Given Kudos: 81
Concentration: , International Business
Send PM
Re: How many points (r, s) can be formed so that r < s, and that the x and [#permalink]
taskforce wrote:
Nice question!
First calculate the number of odd integers between 1 and 399 inclusive that comes up to 200 because the number of the even and odd integers are equal in quantity.
So the total number of integers to chose from is 200.
Now r<s this condition restricts the result:
What we can do is to choose r and then select s:
so r can be selected in 1 way for example 1 then s can selected in 199 ways from 3 to 399.
Similarly we can select r as 3 the number of ways of doing so is also 1 but the number of ways that s can be selected is now 198.
So the series becomes:
(1*199) + (1*198) + (1*197) + .... + (1*1)
We can calculate the sum of this series as [(1+199)/2] * 199 = 19900.
So the answer is 19900.


Sir, I notice that there are 200 odd numbers and in between 1 and 10, we have the ten possibilities that meet the criteria. On doing this way, I got only 400 pairs, what do I missing sir?
Prep Club for GRE Bot
Re: How many points (r, s) can be formed so that r < s, and that the x and [#permalink]
Moderators:
GRE Instructor
77 posts
GRE Forum Moderator
37 posts
Moderator
1111 posts
GRE Instructor
234 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne