It is currently 19 Nov 2017, 09:46

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

# Divide 136 into two parts, one of which when divided by 5

Author Message
Manager
Joined: 28 Jun 2004
Posts: 90

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

Divide 136 into two parts, one of which when divided by 5 [#permalink]

### Show Tags

26 Aug 2004, 18:50
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

Divide 136 into two parts, one of which when divided by 5 leaves a remainder of 2 and the other when divided by 8 leaves a remainder of 3.

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

Senior Manager
Joined: 19 May 2004
Posts: 291

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

### Show Tags

27 Aug 2004, 00:34
I got 77 and 59.

If i'm right, i will explain.
Difficult one!

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

Manager
Joined: 02 Apr 2004
Posts: 222

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

Location: Utrecht

### Show Tags

27 Aug 2004, 00:49
I got 57 and 59 too.

I got this answer by writing down all possible values.
Pretty time consuming, so if there is anyone who has an formula for this kind of question, please let us know.

Regards,

Alex

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

GMAT Club Legend
Joined: 07 Jul 2004
Posts: 5032

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

Location: Singapore

### Show Tags

27 Aug 2004, 01:30
I'm trying to get a formula too !

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

Senior Manager
Joined: 19 May 2004
Posts: 291

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

### Show Tags

27 Aug 2004, 01:44
well, here is what i did.
I hope you guys can improve this.

One number is X, and the other is 136-X.

1) X=5K+2

2) 136-X=8J+3

1,2) 136-5k-2 = 8j+3
Therefore,
131 = 5k + 8j.

Here i got stuck, so i picked numbers and got the correct k and j.
The only thing left was to calculate X accordingly.

If you have any idea how to escape picking numbers i would love to hear it

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

GMAT Club Legend
Joined: 07 Jul 2004
Posts: 5032

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

Location: Singapore

### Show Tags

27 Aug 2004, 02:20
that's exactly what I did. I didn't enjoy picking numbers. on an actual gmat, i think if we needed to do that, it's too time consuming. but on the other hand, in a actual gmat, you would have 5 choices to pick from, so maybe picking numbers won't take that long afterall.

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

Manager
Joined: 15 Jul 2004
Posts: 75

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

Location: London

### Show Tags

27 Aug 2004, 07:33
Dookie wrote:
well, here is what i did.
I hope you guys can improve this.

One number is X, and the other is 136-X.

1) X=5K+2

2) 136-X=8J+3

1,2) 136-5k-2 = 8j+3
Therefore,
131 = 5k + 8j.

Here i got stuck, so i picked numbers and got the correct k and j.
The only thing left was to calculate X accordingly.

If you have any idea how to escape picking numbers i would love to hear it

After obtaining 131 = 5k + 8j, I wrote down two multiplication tables:

x5: 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65...
and
x8: 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 136

From this it takes a few seconds to realise that 96 + 35 = 131, or 75 + 56 = 131 (picking numbers from the x8 multiplication table finishing in either 1 or 6)

Therefore number sets 99 + 37 and 59 + 77 are valid results.

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

Joined: 31 Dec 1969

Kudos [?]: [0], given:

Location: Russian Federation
GMAT 3: 740 Q40 V50
GMAT 4: 700 Q48 V38
GMAT 5: 710 Q45 V41
GMAT 6: 680 Q47 V36
GMAT 9: 740 Q49 V42
GMAT 11: 500 Q47 V33
GMAT 14: 760 Q49 V44
WE: Supply Chain Management (Energy and Utilities)

### Show Tags

30 Aug 2004, 12:10
Hi Everyone, I figured out a different way of solving this that gave me all the possible solutions to this problem Pls let me knows your comments about my solution.

Since we need a number that divided by 5 has a reminder of 2

5,10,15,20,25,30,35,40,45,50,55,60,65,70,75,80,85,90,95,100,105,110,
115,120,125,130,135.

For a number in this table we are going to add 2 in order to get it as a reminder.

{[n(5)]+[n+1(5)]+[n+...(5)]}+2

The same for the table of 8

8,16,24,32,40,48,56,64,72,88,96,104,112,128,136

{[n(8)]+[n+1(8)]+[n+...(8)]}+3

If we add the two figures we get 2+3 = 5

So now we just need 131 instead of 136
Of all the possibles aoutcomes from the table of 8 added to the table of 5 that could help me to get this results,are the ones bolded (we just take the one that finish with 6

8,16,24,32,40,48,56,64,72,88,96,104,112,128

now we just need to find the complement to these numbers to get 131 from the table of 5

for 16 +115 = 131 for 56+75 = 131 for 96+35 = 131

Finally if we add the numbers that we took it before to each one of these
(115+2)+(16+3) = 136
(75+2) + (56+3) = 136
(35+2) + (96+3) = 136

To chek this every single divide the figures 37, 77 and 117 by 5
and 19,59,99 by 8.

I give you an apologize for my poor english, but I hope this way could help to find a different solution.

I would like to hear your comments since this is my first post

Thanks / ArturoC

Kudos [?]: [0], given:

SVP
Joined: 16 Oct 2003
Posts: 1798

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

### Show Tags

30 Aug 2004, 14:15
ArturoC wrote:
Hi Everyone, I figured out a different way of solving this that gave me all the possible solutions to this problem Pls let me knows your comments about my solution.

Since we need a number that divided by 5 has a reminder of 2

5,10,15,20,25,30,35,40,45,50,55,60,65,70,75,80,85,90,95,100,105,110,
115,120,125,130,135.

For a number in this table we are going to add 2 in order to get it as a reminder.

{[n(5)]+[n+1(5)]+[n+...(5)]}+2

The same for the table of 8

8,16,24,32,40,48,56,64,72,88,96,104,112,128,136

{[n(8)]+[n+1(8)]+[n+...(8)]}+3

If we add the two figures we get 2+3 = 5

So now we just need 131 instead of 136
Of all the possibles aoutcomes from the table of 8 added to the table of 5 that could help me to get this results,are the ones bolded (we just take the one that finish with 6

8,16,24,32,40,48,56,64,72,88,96,104,112,128

now we just need to find the complement to these numbers to get 131 from the table of 5

for 16 +115 = 131 for 56+75 = 131 for 96+35 = 131

Finally if we add the numbers that we took it before to each one of these
(115+2)+(16+3) = 136
(75+2) + (56+3) = 136
(35+2) + (96+3) = 136

To chek this every single divide the figures 37, 77 and 117 by 5
and 19,59,99 by 8.

I give you an apologize for my poor english, but I hope this way could help to find a different solution.

I would like to hear your comments since this is my first post

Thanks / ArturoC

I have not seen anyone making so much of an effort in first post. Welcome ArturoC and don't be a guest next time.

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

Intern
Joined: 03 Aug 2004
Posts: 26

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

### Show Tags

31 Aug 2004, 13:43
1. the first number must be X, second number 136 - X...
2. if the second number must have a remainder 3 after dividing by 8, then it is very easy to write down a list of those numbers:
11,19,27,35,43,51,59,67,75,83,91,99,107,115,123,131
3. since the other number must have a remainder 2 after dividing by 5, then the number must end in 2 or 7
4. take 136 and subtract each number in item #2...but you only have to find the ones digit (because the second number must end in either 2 or 7), so you can go through the list very quickly to eliminate the ones that don't leave a 2 or 7 in the ones digit after subtracting
5. that leaves three sets of numbers (117,19) (77,59) (37,99) which all fit the problem

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

31 Aug 2004, 13:43
Display posts from previous: Sort by

# Divide 136 into two parts, one of which when divided by 5

Moderator: chetan2u

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne 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®.