GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 09 Dec 2019, 02:41

Close

GMAT 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 GMAT 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

How many integers from 0 to 50, inclusive, have a remainder

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Find Similar Topics 
Senior Manager
Senior Manager
avatar
Joined: 15 Sep 2011
Posts: 305
Location: United States
WE: Corporate Finance (Manufacturing)
GMAT ToolKit User
Re: How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 01 Jul 2015, 16:55
Calculated the same. \(\frac{Last R1 - First R1}{3} +1 = \frac{(49 - 1)}{3} +1 = 16 + 1 = 17\).

Testing the answer choices if another multiple is needed or if there are one too many. This proved that C was the correct answer.

A. 15 * 3 = 45. 50-45 = R5. Too low.
B. 16 * 3 = 48. 50-48 = R2.
C. 17 * 3 = 51. 50-51 = R1, which is in line with what the question asks.
D. 18 * 3 = 54. 54-50= R4. Too high
E. 19 * 3 = 57. 57-50= R7.Too high
Intern
Intern
avatar
Joined: 25 Jul 2016
Posts: 7
GMAT 1: 740 Q50 V40
How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 14 Sep 2016, 09:47
Economist 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


First, when a integer is divided by 3, it can have the remainder 0,1 or 2.

There are 50-0+1=51 integers between 0 and 50 inclusive.

Just a quick example:
integer 0: remainder 0
integer 1: remainder 1
integer 2: remainder 2
integer 3: remainder 0
integer 4: remainder 1 and so on. Practicaly, there are 51/3=17 remainders of 0, 17 remainders of 1 and 17 remainders of 2. Answer: C
Ask GMAT Experts Forum Moderator
User avatar
V
Status: Preparing for GMAT
Joined: 25 Nov 2015
Posts: 1045
Location: India
GPA: 3.64
GMAT ToolKit User Reviews Badge
Re: How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 14 Sep 2016, 10:11
Number of integers from 0 to 50 with remainder of 1 when divided by 3 can be found out as follows:
Number of integers divisible by 3 from 0 to 50: 48 = 3 + (n-1) * 3 ; using the formula for nth term of series in arithmetic progression ,where nth term is 48, 1st term is 3 and difference between terms is 3.
Therefore n=16, since adding 1 to each of these numbers will give remainder 1, however, when 1 is divided by 3, it gives remainder of 1, hence we have to include 1, giving the total number of integers as 16+1 =17
VP
VP
avatar
P
Joined: 07 Dec 2014
Posts: 1218
How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 14 Sep 2016, 11:03
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

let x=number of integers with a remainder of 1 when divided by 3
range is 1-49
1+3(x-1)=49
x=17
C.
Target Test Prep Representative
User avatar
G
Status: Head GMAT Instructor
Affiliations: Target Test Prep
Joined: 04 Mar 2011
Posts: 2809
Re: How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 26 Sep 2017, 16:24
Economist 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


The first number that has a remainder of 1 when divided by 3 is 1, and the last number is 49.

Thus, the number of integers from 0 to 50 inclusive that have a remainder of 1 when divided by 3 is:

(49 - 1)/3 + 1 = 17

Answer: C
_________________

Jeffrey Miller

Head of GMAT Instruction

Jeff@TargetTestPrep.com
TTP - Target Test Prep Logo
122 Reviews

5-star rated online GMAT quant
self study course

See why Target Test Prep is the top rated GMAT quant course on GMAT Club. Read Our Reviews

If you find one of my posts helpful, please take a moment to click on the "Kudos" button.

VP
VP
User avatar
D
Joined: 09 Mar 2016
Posts: 1229
How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 01 Apr 2018, 06:04
abhishekik wrote:
My ans is also C.17.

Explanation:

1 also gives 1 remainder when divided by 3, another number is 4, then 7 and so on.
Hence we have an arithmetic progression: 1, 4, 7, 10,..... 49, which are in the form 3n+1.
Now we have to find out number of terms.
tn=a+(n-1)d, where tn is the nth term of an AP, a is the first term and d is the common difference.
so, 49 = 1+(n-1)3
or, (n-1)3 = 48
or, n-1 = 16
or, n = 17


hello there :)

from this \(49 = 1+(n-1)3\) I get following:

\(49 = 1+3n-3\)

\(49=3n-2\)

\(3n=51\)

how did you get these value :? --- >

or, (n-1)3 = 48
or, n-1 = 16
or, n = 17
VP
VP
User avatar
D
Joined: 09 Mar 2016
Posts: 1229
How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post Updated on: 01 Apr 2018, 07:36
mejia401 wrote:
Calculated the same. \(\frac{Last R1 - First R1}{3} +1 = \frac{(49 - 1)}{3} +1 = 16 + 1 = 17\).

Testing the answer choices if another multiple is needed or if there are one too many. This proved that C was the correct answer.

A. 15 * 3 = 45. 50-45 = R5. Too low.
B. 16 * 3 = 48. 50-48 = R2.
C. 17 * 3 = 51. 50-51 = R1, which is in line with what the question asks.
D. 18 * 3 = 54. 54-50= R4. Too high
E. 19 * 3 = 57. 57-50= R7.Too high


hello there :)

how about this pushpitkc :) many thanks! :-)

Isnt it formula of number of multiples that you used .... but if it is formula of number of multiples in X range than isnt it used when we need to find number of terms divided by 3 and not when we need to find how many integers leave remainder 1 :?

as in my post (#7) https://gmatclub.com/forum/arithmetic-p ... l#p2035478

Originally posted by dave13 on 01 Apr 2018, 06:13.
Last edited by dave13 on 01 Apr 2018, 07:36, edited 1 time in total.
Senior PS Moderator
User avatar
V
Joined: 26 Feb 2016
Posts: 3302
Location: India
GPA: 3.12
Re: How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 01 Apr 2018, 06:25
1
dave13 wrote:
abhishekik wrote:
My ans is also C.17.

Explanation:

1 also gives 1 remainder when divided by 3, another number is 4, then 7 and so on.
Hence we have an arithmetic progression: 1, 4, 7, 10,..... 49, which are in the form 3n+1.
Now we have to find out number of terms.
tn=a+(n-1)d, where tn is the nth term of an AP, a is the first term and d is the common difference.
so, 49 = 1+(n-1)3
or, (n-1)3 = 48
or, n-1 = 16
or, n = 17


hello there :)

from this \(49 = 1+(n-1)3\) I get following:

\(49 = 1+3n-3\)

\(49=3n-2\)

\(3n=51\)

how did you get these value :? --- >

or, (n-1)3 = 48
or, n-1 = 16
or, n = 17


Hi dave13

We have \(49 = 1+(n-1)3\)

This can be re-written as \((n-1)3 = 49 - 1 = 48\)

Dividing by 3 on both sides, we get \(n-1 = \frac{48}{3} = 16\)

Therefore, we can arrive at n = 17

Hope this helps you!
_________________
You've got what it takes, but it will take everything you've got
Senior PS Moderator
User avatar
V
Joined: 26 Feb 2016
Posts: 3302
Location: India
GPA: 3.12
Re: How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 01 Apr 2018, 10:51
1
dave13 wrote:
mejia401 wrote:
Calculated the same. \(\frac{Last R1 - First R1}{3} +1 = \frac{(49 - 1)}{3} +1 = 16 + 1 = 17\).

Testing the answer choices if another multiple is needed or if there are one too many. This proved that C was the correct answer.

A. 15 * 3 = 45. 50-45 = R5. Too low.
B. 16 * 3 = 48. 50-48 = R2.
C. 17 * 3 = 51. 50-51 = R1, which is in line with what the question asks.
D. 18 * 3 = 54. 54-50= R4. Too high
E. 19 * 3 = 57. 57-50= R7.Too high


hello there :)

how about this pushpitkc :) many thanks! :-)

Isnt it formula of number of multiples that you used .... but if it is formula of number of multiples in X range than isnt it used when we need to find number of terms divided by 3 and not when we need to find how many integers leave remainder 1 :?

as in my post (#7) https://gmatclub.com/forum/arithmetic-p ... l#p2035478



Hi dave13

Yes, the formula only calculates the number of terms divided by 3. But if you observe
every(a number divisible by 3 + 1) will give a remainder of 1 when divided by 3

Here, between 0 and 50(both inclusive), there are
17 numbers which are divisible by 3 - 0(0*3) to 48(16*3)
17 numbers which leave the remainder 1(0*3 + 1) - 49(16*3 + 1)

Hope this helps clear your confusion!
_________________
You've got what it takes, but it will take everything you've got
Intern
Intern
avatar
B
Joined: 02 Oct 2016
Posts: 23
Reviews Badge
Re: How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 08 Apr 2018, 06:58
1
The range of numbers that leave a remainder of 1:
1-49

Therefore total number of integers:
(49-1)/3 + 1 = 17

The last +1 is because the question is inclusive.

Hence C
Intern
Intern
avatar
B
Joined: 02 Jun 2018
Posts: 3
Re: How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 18 Sep 2018, 10:45
50/3 = 16 (int) ----- 16*3= 48. ∴ all these 16 numbers will have a (n+1) value. E.g. 48+1= 49. And include ‘1’ = 0+1. Making the total into 17.
Manager
Manager
avatar
S
Joined: 26 Jan 2015
Posts: 93
CAT Tests
Re: How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 05 Aug 2019, 00:23
From 0 to 50, both included, we have 51 numbers.
The cyclicity of 3 is 3. That means, 3 leaves only 3 reminders, 0,1,2 and the cycle repeats. You can check as below.
Reminder of 0 when divided by 3 = 0
Reminder of 1 when divided by 3 = 1
Reminder of 2 when divided by 3 = 2
Reminder of 3 when divided by 3 = 0
Reminder of 4 when divided by 3 = 1
.
.
.
So, out of 51 numbers, there are only 3 reminders possible when divided by 3. So we can divide 51 numbers into 3 sets.
1.Ones that give 0 as reminder
2.Ones that give 1 as reminder
3.Ones that give 2 as reminder

So 51/3=17.
So the final answer is C.17
Senior Manager
Senior Manager
avatar
D
Joined: 30 Sep 2017
Posts: 455
GMAT 1: 720 Q49 V40
GPA: 3.8
Premium Member Reviews Badge
Re: How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 05 Aug 2019, 00:57
The range of numbers that leave a remainder of 1 when divided by 3:
1,4,...,49

Therefore total number of integers:
Un = U1 + (n-1)*b
49 = 1 + (n-1)*3
n=17

Answer is C

Posted from my mobile device
Director
Director
User avatar
P
Joined: 18 Dec 2017
Posts: 830
Location: United States (KS)
Premium Member CAT Tests
Re: How many integers from 0 to 50, inclusive, have a remainder  [#permalink]

Show Tags

New post 20 Nov 2019, 18:54
Economist 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


Just list the numbers. (If you have solved enough remainder problems you know that the least possible number is remainder itself)

So list from 1,4,7,...........,40,43,47,50.

Count them.

Answer 17.
_________________
D-Day : 21st December 2019

The Moment You Think About Giving Up, Think Of The Reason Why You Held On So Long

Learn from the Legend himself: All GMAT Ninja LIVE YouTube videos by topic
You are missing on great learning if you don't know what this is: Project SC Butler
GMAT Club Bot
Re: How many integers from 0 to 50, inclusive, have a remainder   [#permalink] 20 Nov 2019, 18:54

Go to page   Previous    1   2   [ 34 posts ] 

Display posts from previous: Sort by

How many integers from 0 to 50, inclusive, have a remainder

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  





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