Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 25 Oct 2016, 08:53

# Happening Now:

Live Q&A with UCLA Adcom in Chat1  |  LBS/INSEAD/HECParis Chat will start at 9AM in Chat1

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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# x is a positive integer less than 500. When x is divided by

Author Message
Intern
Joined: 12 Jan 2006
Posts: 20
Location: US
Followers: 0

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

x is a positive integer less than 500. When x is divided by [#permalink]

### Show Tags

05 Nov 2006, 13:47
1
This post was
BOOKMARKED
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

x is a positive integer less than 500. When x is divided by 7, the
remainder is 1; when x is divided by 3, the remainder is 2. How many
such numbers are possible?
_________________

pV

VP
Joined: 28 Mar 2006
Posts: 1381
Followers: 2

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

### Show Tags

05 Nov 2006, 13:59
7m + 1 =3n +2

7m = 3n+1

if n= 2,9,16......

Total 71 numbers
Manager
Joined: 01 Nov 2006
Posts: 70
Followers: 1

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

### Show Tags

05 Nov 2006, 14:21
Here's a helpful thm for these kinds of problems:

Notation: A number n when divided by k has remainder r, we say that
n = r Mod k

E.g., 28 = 4 mod 6
4 = 1 mod 3
0 = n mod n

Thm: If n = r Mod k then n*t = r*t Mod k (t an integer obviously)

E.g., (for this problem)

7 = 1 mod 3 so 7*t = t Mod 3 so 7 = 1 Mod 3, 14 = 7*2 =2 Mod 3, 21 = 7*3 = 3 Mod 3 = 0 Mod 3, 28 = 7*4 = 4 Mod 3 = 1 mod 3, 35 = 2 Mod 3, ...

So the sequence is {1, 2, 0, 1, 2, 0, ...}

The question asks " How many + numbers n < 500 of the form 7*k + 1 are equal to 2 mod 3?" (so maybe it is by now clear that it's 1/3 of the numbers of this form...)

8 = (7*1 + 1) Mod 3 = 7*1 Mod 3 + 1 Mod 3 = 2 mod 3
15 = (7*2 + 1) Mod 3 = 2 Mod 3 + 1 Mod 3 = 0 mod 3
22 = (7*3 + 1) Mod 3 = 3 mod 3 + 1 Mod 3 = 1 mod 3
29 = 2 Mod 3
36 = 0 Mod 3
43 = 1 Mod 3
...
498 = (7*71 + 1) Mod 3 = 71 Mod 3 + 1 Mod 3 = 0 Mod 3

So there are 71 numbers less than 500 of the form 2 Mod 7 and 1 out of 3 is of the form 2 Mod 3 so it's just a matter of checking the endpoints and so the asnwer is 24 because we start with 2 Mod 3 and end with 0 mod 3.

That seems complicated and long-winded, but the principles can help you do these problems in no time (maybe there's a good review of modular arithmetic somewhere on the web).
Manager
Joined: 01 Nov 2006
Posts: 70
Followers: 1

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

### Show Tags

05 Nov 2006, 14:25
trivikram wrote:
7m + 1 =3n +2

7m = 3n+1

if n= 2,9,16......

Total 71 numbers

Nope (Check the numbers) 2 divided by 7 has remainder 2 (not 1), etc..
VP
Joined: 28 Mar 2006
Posts: 1381
Followers: 2

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

### Show Tags

05 Nov 2006, 17:32
joeydvivre wrote:
trivikram wrote:
7m + 1 =3n +2

7m = 3n+1

if n= 2,9,16......

Total 71 numbers

Nope (Check the numbers) 2 divided by 7 has remainder 2 (not 1), etc..

Sorry it should be 24 and not 71

I never mentioned that 2,7,16 leave a reminder when divided by 7 but they do form a pattern leaving a reminder 2 and substituting n in

7m = 3n+1 then 3n+1 is a multiple of 7

when n=2 m=1
when n=9 m=4
when n=16 m=7
....
.....
when n= 163 m=70

So there are 24 numbers like this....
VP
Joined: 25 Jun 2006
Posts: 1172
Followers: 3

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

### Show Tags

06 Nov 2006, 01:35
yes. there are 24.

n can be expressed as
n = 7m + 1, where m = 1, 4, 7, ..
then express m = 3x + 1, where x = 0, 1, 2, 3...

then n = 21x + 8. and 21x+8 < 500, u solve x <=23.

and x can be 0, so total no of x is 24. hence total no of n is 24.
Intern
Joined: 05 Nov 2006
Posts: 18
Followers: 0

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

### Show Tags

07 Nov 2006, 13:34
[quote="tennis_ball"]yes. there are 24.

n can be expressed as
n = 7m + 1, where m = 1, 4, 7, ..
then express m = 3x + 1, where x = 0, 1, 2, 3...

then n = 21x + 8. and 21x+8 < 500, u solve x <=23.

and x can be 0, so total no of x is 24. hence total no of n is 24.[/quote]

Where did you get the values of "m" from, and why did you make M a function of X.
VP
Joined: 21 Aug 2006
Posts: 1025
Followers: 1

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

### Show Tags

07 Nov 2006, 21:42
trivikram wrote:
joeydvivre wrote:
trivikram wrote:
7m + 1 =3n +2

7m = 3n+1

if n= 2,9,16......

Total 71 numbers

Nope (Check the numbers) 2 divided by 7 has remainder 2 (not 1), etc..

Sorry it should be 24 and not 71

I never mentioned that 2,7,16 leave a reminder when divided by 7 but they do form a pattern leaving a reminder 2 and substituting n in

7m = 3n+1 then 3n+1 is a multiple of 7

when n=2 m=1
when n=9 m=4
when n=16 m=7
....
.....
when n= 163 m=70

So there are 24 numbers like this....

What is X? how do we get that?
_________________

The path is long, but self-surrender makes it short;
the way is difficult, but perfect trust makes it easy.

VP
Joined: 21 Aug 2006
Posts: 1025
Followers: 1

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

### Show Tags

07 Nov 2006, 22:39
Paayal wrote:
x is a positive integer less than 500. When x is divided by 7, the
remainder is 1; when x is divided by 3, the remainder is 2. How many
such numbers are possible?

Vikram, 24 is answer for this question. What I was asking was what is 'x' in the question.

I agree..it is a series of numbers. But can you please post a few initial numbers in the series?
_________________

The path is long, but self-surrender makes it short;
the way is difficult, but perfect trust makes it easy.

GMAT Club Legend
Joined: 07 Jul 2004
Posts: 5062
Location: Singapore
Followers: 30

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

### Show Tags

07 Nov 2006, 23:18
x = 7m+1
x = 3n+2

7m+1 = 3n+2
7m = 3n+1

3n+1 must be a multiple of 7

3n+1 = 7, n = 2
3n+1 = 28, n = 9
3n+1 = 49, n = 16

3n+2 < 500, so bigger number possible is 497 --> n = 165

So number of possible numbers = (165-2)/7 + 1 = 24
VP
Joined: 28 Mar 2006
Posts: 1381
Followers: 2

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

### Show Tags

09 Nov 2006, 19:54
ak_idc wrote:
Paayal wrote:
x is a positive integer less than 500. When x is divided by 7, the
remainder is 1; when x is divided by 3, the remainder is 2. How many
such numbers are possible?

Vikram, 24 is answer for this question. What I was asking was what is 'x' in the question.

I agree..it is a series of numbers. But can you please post a few initial numbers in the series?

x is the # of "numbers" between 2 and <500 satisfying the given conditions....
GMAT Club Legend
Joined: 09 Sep 2013
Posts: 12220
Followers: 542

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

Re: x is a positive integer less than 500. When x is divided by [#permalink]

### Show Tags

31 Aug 2015, 10:17
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
Re: x is a positive integer less than 500. When x is divided by   [#permalink] 31 Aug 2015, 10:17
Display posts from previous: Sort by