When an integer Z is divided by 3, it leaves 1 as a

Oldest

Best Reply

Author

Message

TAGS:

SVP

Joined: 03 Feb 2003

Posts: 1680

Followers: 4

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

When an integer Z is divided by 3, it leaves 1 as a [#permalink]

15 Jul 2003, 09:54

00:00

Question Stats:

0% (00:00) correct

0% (00:00) wrong

based on 0 sessions

When an integer Z is divided by 3, it leaves 1 as a remainder. When Z is divided by 5, it leaves 3 as a remainder. When Z is divided by 7, it leaves 5 as a remainder.

1. Find the smallest positive Z.
2. Find the next smallest positive Z.

Manager

Joined: 08 Apr 2003

Posts: 153

Followers: 1

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

[#permalink]

15 Jul 2003, 10:39

This one was dificult indeed.
I got the first one..
it's 103.

I shall try to post my soltion again after some thought

Manager

Joined: 07 Jul 2003

Posts: 60

Followers: 2

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

[#permalink]

15 Jul 2003, 10:51

Please submit the solution too (Explaination) which book do I get such problems.

:shock:

_________________

Attain Moksha

SVP

Joined: 03 Feb 2003

Posts: 1680

Followers: 4

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

[#permalink]

15 Jul 2003, 11:57

satgates wrote:

Please submit the solution too (Explaination) which book do I get such problems.

:shock:

The question is mine; probably you will not find it in books.
Meanwhile, the solution is not that difficult.

Z=3n+1
Z=5k+3
Z=7p+5 the trick is to see that each time a quotinent is 2 more than a remainder. Therefore, add 2 to both parts and get what you need.

Z+2=3n+1+2=3n+3, divisible by 3
Z+2=5k+3+2=5k+5, divisible by 5
Z+2=7p+5+2=7k+7, divisible by 7

so, Z+2 is divisible by 3, 5, and 7.

To find the smallest positive Z, we have to subtract 2 from the LCM of 3, 5, 7.

LCM = 3*5*7, since they all are primes = 105
105-2=103 is the answer.

To find the second smallest number: 2LCM-2=210-2=208 and so on.

Do you like the question? It is one of my best.

Manager

Joined: 08 Apr 2003

Posts: 153

Followers: 1

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

[#permalink]

15 Jul 2003, 13:37

Excellent!!! Can i say anything better than that... Well i logged to post my second answer but saw your post and was pleased to see it. The idea behind the question is simply brilliant. :cool

SVP

Joined: 30 Oct 2003

Posts: 1963

Location: NewJersey USA

Followers: 3

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

[#permalink]

24 Jan 2004, 17:46

This is one of the best solutions I have ever seen.
For these kinds of problems I simply used to mutiply the divisors and get a product. The desired number should lie in the visinity of this product. I used to search around this number using trial and error.
stolyar's solution has made it eaven easier.

Manager

Joined: 28 Jan 2004

Posts: 209

Location: India

Followers: 2

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

[#permalink]

29 Jan 2004, 01:03

What a great logic stolyar.........i use to beat my head with such questions,but looks to me that it will not happen any more.........Kudos man for such a nice solution.

[#permalink] 29 Jan 2004, 01:03

		Similar topics	Author	Replies	Last post
Similar Topics:		When an integer Q is divided by 5, it leaves 1 as a	stolyar	2	15 Jul 2003, 09:48
		An integer when divided by 12 leaves remainder 0,when	Praetorian	8	06 Oct 2003, 02:26
		What is integer n? 1. When divided by 7, remainder is 3 2.	vivek123	13	02 Apr 2006, 10:55
	1	Q. When integer x is divided by 3, the remainder is 1; when	pretttyune	1	12 Nov 2007, 04:42
		When an integer Q is divided by 5, it leaves 1 as a	young_gun	4	29 Nov 2007, 20:00

When an integer Z is divided by 3, it leaves 1 as a

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

When an integer Z is divided by 3, it leaves 1 as a

When an integer Z is divided by 3, it leaves 1 as a

Main navigation

GMAT Resources

Partners

MBA Resources