Last visit was: 21 Nov 2024, 18:57 It is currently 21 Nov 2024, 18:57

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
Verbal Expert
Joined: 18 Apr 2015
Posts: 30003
Own Kudos [?]: 36341 [0]
Given Kudos: 25927
Send PM
Verbal Expert
Joined: 18 Apr 2015
Posts: 30003
Own Kudos [?]: 36341 [0]
Given Kudos: 25927
Send PM
avatar
Intern
Intern
Joined: 17 Aug 2020
Posts: 40
Own Kudos [?]: 31 [0]
Given Kudos: 0
Send PM
avatar
Intern
Intern
Joined: 15 Aug 2020
Posts: 5
Own Kudos [?]: 9 [2]
Given Kudos: 0
Send PM
Re: How many integers from 0 to 50, inclusive, have a remainder [#permalink]
2
if a number when divided by 3 and has reminder of 1 then the number is written as 3K+1, so we can consider all the multiples of 3 which are less than 50(because if 50 is considered then 50+1 is 51, which is 51), so numbers will be 0, 3,6...48(which are multiple of 3 less than 50) and last multiple is 48, that is 3*16, so total count is 17(including 0). Hence Answer is C
avatar
Retired Moderator
Joined: 20 Aug 2020
Posts: 49
Own Kudos [?]: 59 [0]
Given Kudos: 0
Send PM
Re: How many integers from 0 to 50, inclusive, have a remainder [#permalink]
1
Carcass wrote:
How many integers from 0 to 50, inclusive, have a remainder of 1 when divided by 3 ?

A. 15
B. 16
C. 17
D. 18
E. 19


Remind that the number of terms in an arithmetic sequence is \(\frac{l-f}{d} + 1\), where \(l, f\) and \(d\) are its last term, it first term and its common difference, respectively.

The numbers between \(0\) and \(50\), inclusive with the remainder \(1\), when divided by \(3\) are \(1, 4, 7, ... , 49\), which is an arithmetic sequence.

Thus, the number of terms is \(\frac{49-1}{3}+1 = \frac{48}{3}+1 = 16+1 = 17\).

Therefore, the right answer is C.
Retired Moderator
Joined: 10 Apr 2015
Posts: 6218
Own Kudos [?]: 12196 [0]
Given Kudos: 136
Send PM
Re: How many integers from 0 to 50, inclusive, have a remainder [#permalink]
1
Carcass wrote:
How many integers from 0 to 50, inclusive, have a remainder of 1 when divided by 3 ?

A. 15
B. 16
C. 17
D. 18
E. 19


Although there are different (and clever) ways to answer this question, I think the fastest (and most accurate) approach is to simply list the values in your head as you count on your fingers (or use a tally sheet)

We get: 1, 4, 7, 10, 13, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 49

Answer: C


Cheers,
Brent
avatar
Intern
Intern
Joined: 25 Aug 2020
Posts: 9
Own Kudos [?]: 11 [0]
Given Kudos: 0
Send PM
Re: How many integers from 0 to 50, inclusive, have a remainder [#permalink]
1
If you want to solve problems like these under 1 minute then always approach it by dividing the number by the given integer

how to know the pattern
3*1 + 1= 4 (rem = 1when div by 3)
3*2 + 1 = 7 (rem = 1when div by 3)
.....

50/3= 16.667
so we know 3*16 = 48 (hence 16 numbers are to be there which will give rem = 1) because 48 + 1 is < 50
finally add 1 because it'll give the same rem so
Answer is C ->17
Intern
Intern
Joined: 02 Jan 2021
Posts: 27
Own Kudos [?]: 12 [0]
Given Kudos: 41
Send PM
Re: How many integers from 0 to 50, inclusive, have a remainder [#permalink]
@greenlightprep

Sir, but why do we include 1 in the list?

how can 1 divided by 3 yield a remainder of 1?
Moderator
Moderator
Joined: 02 Jan 2020
Status:GRE Quant Tutor
Posts: 1111
Own Kudos [?]: 964 [0]
Given Kudos: 9
Location: India
Concentration: General Management
Schools: XLRI Jamshedpur, India - Class of 2014
GMAT 1: 700 Q51 V31
GPA: 2.8
WE:Engineering (Computer Software)
Send PM
Re: How many integers from 0 to 50, inclusive, have a remainder [#permalink]
We need to find How many integers from 0 to 50, inclusive, have a remainder of 1 when divided by 3y

Theory: Dividend = Divisor*Quotient + Remainder

Number, n -> Dividend
3 -> Divisor
q -> Quotient (Assume)
1 -> Remainder

=> n = 3*q + 1 = 3q + 1

( Watch this video to learn about Basics of Remainders )

Between 0 and 50
If we put q = 0, we will get the starting number as
n = 3*0 + 1 = 1

If we put q = 16, we will get the ending number as
n = 3*16 + 1 = 48 + 1 = 49

(Hint: here itself we can get the number of possible numbers as 16 + 1 = 17)

So, we have the numbers as 1 , 4, 7, ...., 49

This is an Arithmetic Sequence with

First term, a = 1
Common difference, d = 3
Last term, \(T_n\) = 49

=> Number of terms, n = (\(T_n\) - a) / d + 1 = \(\frac{49 - 1}{3}\) + 1 = \(\frac{48}{3}\) + 1 = 17

So, Answer will be C
Hope it helps!

Watch the following video to learn How to Sequence problems

Prep Club for GRE Bot
Re: How many integers from 0 to 50, inclusive, have a remainder [#permalink]
Moderators:
GRE Instructor
84 posts
GRE Forum Moderator
37 posts
Moderator
1111 posts
GRE Instructor
234 posts

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