How many integers from 0-50 have a remainder of 3 when divid

Oldest

Best Reply

Author

Message

TAGS:

Manager

Joined: 17 Aug 2009

Posts: 241

Followers: 2

Kudos [?]: 61 [0], given: 25

How many integers from 0-50 have a remainder of 3 when divid [#permalink]

17 Dec 2009, 02:41

00:00

Question Stats:

58% (01:23) correct

41% (00:55) wrong

based on 5 sessions

How many integers from 0-50 have a remainder of 3 when divided by 9?

A. 5
B. 6
C. 7
D. 8
E. 9

[Reveal] Spoiler: OA

Manager

Status: Applying Now

Joined: 21 Nov 2009

Posts: 67

WE: Project Management (Manufacturing)

Followers: 2

Kudos [?]: 28 [0], given: 3

Re: Remainder Problem [#permalink]

17 Dec 2009, 02:55

All numbers should be of the form 9c+3 where c is a constant.

Min is 3 for c=0
Max in 48 for c=5

The answer should be B = 6
_________________

http://gmatclub.com/forum/insead-campus-visit-debrief-91669.html#p702796

If you like my post, consider giving me a kudos. THANKS!

GMAT Club team member

Joined: 02 Sep 2009

Posts: 11505

Followers: 1790

Kudos [?]: 9510 [0], given: 826

Re: Remainder Problem [#permalink]

17 Dec 2009, 03:13

zaarathelab wrote:

How many integers from 0-50 have a remainder of 3 when divided by 9?

A. 5
B 6
C 7
D 8
E 9

A remainder of 3 when divided by 9 --> n=9q+3, where q is an integer \geq{0}.

9q+3<50 --> q<5\frac{2}{9}, hence q can take 6 values from 0 to 5.

Answer: B (6).

Or, one can just manually list the numbers of the form n=9q+3, which are less than 50: 3, 12, 21, 30, 39, and 48. Total of 6 numbers.
_________________

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory

COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!

What are GMAT Club Tests?
25 extra-hard Quant Tests

Find out what's new at GMAT Club - latest features and updates

Intern

Joined: 18 Oct 2011

Posts: 3

Followers: 0

Kudos [?]: 0 [0], given: 3

Re: Remainder Problem [#permalink]

06 Feb 2013, 04:01

Range of numbers is 50-0+1= 51.
Possible remainders= 0,1,2,3,4,5,6,7,8
51/9 gives a quotient 5 and a remainder 6. This means that after completing 5 rounds from 0 to 8 ,it found numbers with remainders from 0 to 5 and this has 1 extra count for remainder 3.Hence it is 5+1=6

Re: Remainder Problem [#permalink] 06 Feb 2013, 04:01

		Similar topics	Author	Replies	Last post
Similar Topics:		When a positive integer n is divided by 3, the remainder is	asaf	3	14 Jul 2007, 14:07
		When the integer n is divided by 6, the remainder is 3,	el1981	1	31 Mar 2008, 18:18
	1	when a positive integer x is divided by 3, the remainder is	vd	19	13 Jun 2008, 00:00
		When the integer k is divided by 12, the remainder is 3.	goalsnr	1	06 Jul 2008, 21:25
		When the integer k is divided by 12, the remainder is 3.	sirlogic	5	19 Jul 2008, 03:44

How many integers from 0-50 have a remainder of 3 when divid

Main navigation

GMAT Resources

Partners

MBA Resources

GMAT ® is a registered trademark of the Graduate Management Admission Council ® (GMAC ®). GMAT Club's website has not been reviewed or endorsed by GMAC.

GMAT Courses

Admissions Consulting

How many integers from 0-50 have a remainder of 3 when divid

How many integers from 0-50 have a remainder of 3 when divid

Main navigation

GMAT Resources

Partners

MBA Resources