It is currently 19 Sep 2017, 06:45

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

If x and y are non-zero integers, what is the remainder when

Author Message
Intern
Joined: 12 Mar 2004
Posts: 35

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

Location: Mumbai INDIA
If x and y are non-zero integers, what is the remainder when [#permalink]

Show Tags

13 Dec 2004, 02:46
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

If x and y are non-zero integers, what is the remainder when x is divided by y?

1. x when divided by 2y gives a remainder of 4

2. (x+y) when divided by y gives a remainder of 4

Can anyone show how to solve such problems algebraically since plugging numbers can be time consuming sometimes.

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

Senior Manager
Joined: 19 May 2004
Posts: 291

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

Show Tags

13 Dec 2004, 06:14
B?

1. x when divided by 2y gives a remainder of 4
x = (2y)*k + 4
Seems insufficient.

2. (x+y) when divided by y gives a remainder of 4
x+y = ky + 4
x = (k-1)y + 4
Sufficient. Remainder will be 4.
Moreover,
(x+y)/y (remaider 4) can be simplified to x/y + y/y. Since y/y never has a remainder, regardless of the value of y, the remainder when x is divided by y will always be the same as the remainder when (x+y)y.

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

Director
Joined: 07 Nov 2004
Posts: 683

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

Show Tags

13 Dec 2004, 07:07
D.

Same explanation as above...

Quote:
1. x when divided by 2y gives a remainder of 4
x = (2y)*k + 4
Seems insufficient.

2. (x+y) when divided by y gives a remainder of 4
x+y = ky + 4
x = (k-1)y + 4
Sufficient. Remainder will be 4.

s1: x=(2y)k+4 => x = y(2k) + 4
Remainder 4.

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

Senior Manager
Joined: 19 May 2004
Posts: 291

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

Show Tags

13 Dec 2004, 07:28
No, consider the following example:
If X=10, Y=3.
10/(2*3) leaves remainder 4. Great.
But 10/3 leaves remainder 1.

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

CIO
Joined: 09 Mar 2003
Posts: 463

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

Show Tags

13 Dec 2004, 08:26
Dookie wrote:
No, consider the following example:
If X=10, Y=3.
10/(2*3) leaves remainder 4. Great.
But 10/3 leaves remainder 1.

I really tried to do this algebraically, and then I broke down and plugged in. I think it's a great question, and I (personally) found it difficult to wrap my head around it without some numbers.

I tried a couple options for number 1. 24/10 and 24/5 gave the same remainder. Then I searched my head for a number that's divisible by something but not twice that something. I came up with 60/8 and 60/4.

I know this is a little sloppy, but when I laid out the algebra, I just couldn't see it.

For 2, I tried just one example and then it all made sense. Remainders are set up kind of like multiples. If I divide a number by 5 and get some remainder, then 5 more than that number will give me the same remainder. That's what number 2 is saying, and it was clear right away that it's sufficient.

B

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

Director
Joined: 07 Nov 2004
Posts: 683

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

Show Tags

13 Dec 2004, 09:19
Dookie wrote:
No, consider the following example:
If X=10, Y=3.
10/(2*3) leaves remainder 4. Great.
But 10/3 leaves remainder 1.

I guess plugging in, is the best way to go about it...

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

Director
Joined: 19 Nov 2004
Posts: 556

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

Location: SF Bay Area, USA

Show Tags

13 Dec 2004, 19:41
This might be problem that might be easily solved by substitution.

Let me try and confirm using Algebra though

x = yk1 +C1

Statement 1)
x = 2yk2 + 4

equating the original equation and this as LHS is x

yk1 + C1 = 2yk2+4
C1 = y(2k2-k1) +4

If k1 = 2k2, C1 = 4

But if k1 <>2K2 (which can happen if y can go more times when dividing x than 2y can when dividing x, for example.)

C 1 <>4 in this case

Does not work.

2) x+y = (y)k2 + 4
using the original equations and this as LHS is x

(yk1 + C1) +y = (y)k2 + 4
C1 = y(k2-1-k1) +4

We know k2 = k1 +1, as y will go one more times on x+y than it would just on x.

It is always 4

B it is.

Like I said doing this using algebra in 2 minute is tough, so substitution might be better for this one.

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

13 Dec 2004, 19:41
Display posts from previous: Sort by