How many integers from 0 to 1000 inclusive, have a remainder of 3 when divided by 16?
A. 61
B. 62
C. 63
D. 64
E. 65
QA is c
Can some experts help me with this? How to come up with the correct answer?
Thanks
Remainder
This topic has expert replies
-
- Moderator
- Posts: 772
- Joined: Wed Aug 30, 2017 6:29 pm
- Followed by:6 members
- DavidG@VeritasPrep
- Legendary Member
- Posts: 2663
- Joined: Wed Jan 14, 2015 8:25 am
- Location: Boston, MA
- Thanked: 1153 times
- Followed by:128 members
- GMAT Score:770
Call the integers that give a remainder of 3 when divided by 16: 16x + 3Roland2rule wrote:How many integers from 0 to 1000 inclusive, have a remainder of 3 when divided by 16?
A. 61
B. 62
C. 63
D. 64
E. 65
QA is c
Can some experts help me with this? How to come up with the correct answer?
Thanks
Smallest number in the range that gives a remainder of 3 when divided by 16: 3; (when x = 0)
Largest number in the range that gives a remainder of 3 when divided by 16: 995; (when x = 62) note: it's easy to see that 16*60 + 3 = 963. From there, it's straightforward to extrapolate the largest possible value. 16*61 + 3 = 979; 16*62 + 3 = 995.
Number of integers between 0 and62 inclusive: 63. The answer is C
- EconomistGMATTutor
- GMAT Instructor
- Posts: 555
- Joined: Wed Oct 04, 2017 4:18 pm
- Thanked: 180 times
- Followed by:12 members
Hello Roland2rule.
The idea here is to find a number N such that $$16\cdot N+3\le1000\ and\ N\ge0.$$
Let's try some test values:
$$N=50=>16\cdot50+3=803\ \le\ 1000.$$
This tell us that all there are 51 integers that satisfy the condition above. Now, let's try with a greater N.
$$N=60\ =>\ 16\cdot60+3=963\le1000.$$
If we try with N=62 and N=63 we will get
$$N=62\ =>\ 16\cdot62+3=995\le1000$$ $$N=63\ =>\ 16\cdot63+3=1011>1000$$
So, the 63 doesn't satisfy the condition.
In conclusion, all the integers from 0 to 62 satisfy the condition, that is to say, there are 63 integers that have a remainder of 3 when divided by 16.
The correct answer is C.
I hope this answer can help you.
Regards.
The idea here is to find a number N such that $$16\cdot N+3\le1000\ and\ N\ge0.$$
Let's try some test values:
$$N=50=>16\cdot50+3=803\ \le\ 1000.$$
This tell us that all there are 51 integers that satisfy the condition above. Now, let's try with a greater N.
$$N=60\ =>\ 16\cdot60+3=963\le1000.$$
If we try with N=62 and N=63 we will get
$$N=62\ =>\ 16\cdot62+3=995\le1000$$ $$N=63\ =>\ 16\cdot63+3=1011>1000$$
So, the 63 doesn't satisfy the condition.
In conclusion, all the integers from 0 to 62 satisfy the condition, that is to say, there are 63 integers that have a remainder of 3 when divided by 16.
The correct answer is C.
I hope this answer can help you.
Regards.
GMAT Prep From The Economist
We offer 70+ point score improvement money back guarantee.
Our average student improves 98 points.
We offer 70+ point score improvement money back guarantee.
Our average student improves 98 points.
GMAT/MBA Expert
- Jeff@TargetTestPrep
- GMAT Instructor
- Posts: 1462
- Joined: Thu Apr 09, 2015 9:34 am
- Location: New York, NY
- Thanked: 39 times
- Followed by:22 members
The first number from 0 to 1000 inclusive that has a remainder of 3 when divided by 16 is 3, and the last number is 995.Roland2rule wrote:How many integers from 0 to 1000 inclusive, have a remainder of 3 when divided by 16?
A. 61
B. 62
C. 63
D. 64
E. 65
Thus, there are (995 - 3)/16 + 1 = 63 integers from 0 to 1000 inclusive that have a remainder of 3 when divided by 16.
Answer: C
Jeffrey Miller
Head of GMAT Instruction
[email protected]
See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews