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

It is currently 23 Oct 2014, 06:31

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.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

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

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
SVP
SVP
User avatar
Joined: 03 Feb 2003
Posts: 1613
Followers: 6

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

When an integer Z is divided by 3, it leaves 1 as a [#permalink] New post 15 Jul 2003, 08:54
00:00
A
B
C
D
E

Difficulty:

(N/A)

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
Manager
avatar
Joined: 08 Apr 2003
Posts: 149
Followers: 1

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

 [#permalink] New post 15 Jul 2003, 09: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
Manager
avatar
Joined: 07 Jul 2003
Posts: 56
Followers: 2

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

 [#permalink] New post 15 Jul 2003, 09:51
Please submit the solution too (Explaination) which book do I get such problems.

:shock: :x :cry:
_________________

Attain Moksha

SVP
SVP
User avatar
Joined: 03 Feb 2003
Posts: 1613
Followers: 6

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

 [#permalink] New post 15 Jul 2003, 10:57
satgates wrote:
Please submit the solution too (Explaination) which book do I get such problems.

:shock: :x :cry:


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
Manager
avatar
Joined: 08 Apr 2003
Posts: 149
Followers: 1

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

 [#permalink] New post 15 Jul 2003, 12: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
SVP
User avatar
Joined: 30 Oct 2003
Posts: 1798
Location: NewJersey USA
Followers: 4

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

 [#permalink] New post 24 Jan 2004, 16: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
Manager
avatar
Joined: 28 Jan 2004
Posts: 204
Location: India
Followers: 2

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

 [#permalink] New post 29 Jan 2004, 00: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, 00:03
    Similar topics Author Replies Last post
Similar
Topics:
Is integer x divisible by 3? (1) When x is divided by 5, the banksy 4 04 Mar 2011, 18:32
When an integer Q is divided by 5, it leaves 1 as a young_gun 4 29 Nov 2007, 19:00
1 Q. When integer x is divided by 3, the remainder is 1; when pretttyune 1 12 Nov 2007, 03:42
What is integer n? 1. When divided by 7, remainder is 3 2. alimad 4 27 Sep 2006, 12:35
What is integer n? 1. When divided by 7, remainder is 3 2. vivek123 13 02 Apr 2006, 09:55
Display posts from previous: Sort by

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

  Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.