It is currently 19 Nov 2017, 07:30

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

# For integers x and y, when x is divided by y, the remainder

Author Message
TAGS:

### Hide Tags

Manager
Joined: 09 Feb 2013
Posts: 121

Kudos [?]: 1173 [1], given: 17

For integers x and y, when x is divided by y, the remainder [#permalink]

### Show Tags

28 Feb 2013, 05:27
1
KUDOS
12
This post was
BOOKMARKED
00:00

Difficulty:

75% (hard)

Question Stats:

55% (01:39) correct 45% (01:48) wrong based on 338 sessions

### HideShow timer Statistics

For integers x and y, when x is divided by y, the remainder is odd. Which of the following must be true?

A. x is odd
B. xy is odd
C. x and y share no common factors other than 1
D. The sum x + y is odd
E. At least one of x and y is odd
[Reveal] Spoiler: OA

_________________

Kudos will encourage many others, like me.
Good Questions also deserve few KUDOS.

Last edited by Bunuel on 28 Feb 2013, 05:52, edited 1 time in total.
Edited the question and the tags.

Kudos [?]: 1173 [1], given: 17

Math Expert
Joined: 02 Sep 2009
Posts: 42247

Kudos [?]: 132677 [4], given: 12331

Re: For integers x and y, when x is divided by y, the remainder [#permalink]

### Show Tags

28 Feb 2013, 06:02
4
KUDOS
Expert's post
4
This post was
BOOKMARKED
For integers x and y, when x is divided by y, the remainder is odd. Which of the following must be true?

A. x is odd. Not necessarily true. Consider x=4 and y=3.

B. xy is odd. Not necessarily true. Consider x=4 and y=3.

C. x and y share no common factors other than 1. Not necessarily true. Consider x=3 and y=6.

D. The sum x + y is odd. Not necessarily true. Consider x=1 and y=3.

E. At least one of x and y is odd. If both x and y were even, then the remainder when x is divided by y would be even, not odd. Hence at least one of x and y is odd.

Hope it's clear.
_________________

Kudos [?]: 132677 [4], given: 12331

Senior Manager
Joined: 22 Nov 2010
Posts: 286

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

Location: India
GMAT 1: 670 Q49 V33
WE: Consulting (Telecommunications)
Re: For integers x and y, when x is divided by y, the remainder [#permalink]

### Show Tags

28 Feb 2013, 07:02
For integers x and y, when x is divided by y, the remainder is odd. Which of the following must be true?

A. x is odd. May be. not must.
B. xy is odd. x= 6, y =5 R= 1. xy is not odd
C. x and y share no common factors other than 1. x=12 , y=9. r= 3. common factor = 3, 1
D. The sum x + y is odd. x= 3, y=5. r= 3. x+y = 8 even
E. At least one of x and y is odd. correct
_________________

YOU CAN, IF YOU THINK YOU CAN

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

Non-Human User
Joined: 09 Sep 2013
Posts: 15690

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

Re: For integers x and y, when x is divided by y, the remainder [#permalink]

### Show Tags

16 Feb 2015, 05:44
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.
_________________

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

Non-Human User
Joined: 09 Sep 2013
Posts: 15690

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

Re: For integers x and y, when x is divided by y, the remainder [#permalink]

### Show Tags

13 Mar 2016, 06:46
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.
_________________

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

Retired Moderator
Joined: 12 Aug 2015
Posts: 2213

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

Re: For integers x and y, when x is divided by y, the remainder [#permalink]

### Show Tags

17 Mar 2016, 05:46
Here we the easiest way out is use the examples
Now by using 3/11 ; 3/9 and 3/12 => all options can be eliminated except the last one => E
_________________

Give me a hell yeah ...!!!!!

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

Non-Human User
Joined: 09 Sep 2013
Posts: 15690

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

Re: For integers x and y, when x is divided by y, the remainder [#permalink]

### Show Tags

21 Aug 2017, 04:36
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.
_________________

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

Intern
Joined: 25 Jul 2011
Posts: 44

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

Location: India
Concentration: Strategy, Operations
GMAT 1: 740 Q49 V41
GPA: 3.5
WE: Engineering (Energy and Utilities)
For integers x and y, when x is divided by y, the remainder [#permalink]

### Show Tags

21 Aug 2017, 05:22
stonecold wrote:
Here we the easiest way out is use the examples
Now by using 3/11 ; 3/9 and 3/12 => all options can be eliminated except the last one => E

I have got one more;

let X=nY+R (n= some quotient, R=remainder)

or X=nY+2k+1 (2k+1=odd remainder)

Now if Y is even;

X=nY+2k+1=even+even+1=odd

and if Y is odd;

X=(odd or even)+(even)+1
=(odd or even)

So,
at least 1 of X and Y will always be Odd.

Kudos plz if you find this solution useful...
_________________

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

For integers x and y, when x is divided by y, the remainder   [#permalink] 21 Aug 2017, 05:22
Display posts from previous: Sort by