GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 13 Dec 2018, 14:44

### 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 December
PrevNext
SuMoTuWeThFrSa
2526272829301
2345678
9101112131415
16171819202122
23242526272829
303112345
Open Detailed Calendar
• ### GMATbuster's Weekly GMAT Quant Quiz, Tomorrow, Saturday at 9 AM PST

December 14, 2018

December 14, 2018

09:00 AM PST

10:00 AM PST

10 Questions will be posted on the forum and we will post a reply in this Topic with a link to each question. There are prizes for the winners.
• ### The winning strategy for 700+ on the GMAT

December 13, 2018

December 13, 2018

08:00 AM PST

09:00 AM PST

What people who reach the high 700's do differently? We're going to share insights, tips and strategies from data we collected on over 50,000 students who used examPAL.

# If (x # y) represents the remainder that results when the po

Author Message
TAGS:

### Hide Tags

Intern
Joined: 17 Oct 2013
Posts: 1
If (x # y) represents the remainder that results when the po  [#permalink]

### Show Tags

Updated on: 29 Mar 2014, 13:55
18
00:00

Difficulty:

35% (medium)

Question Stats:

72% (01:39) correct 28% (01:46) wrong based on 284 sessions

### HideShow timer Statistics

If (x # y) represents the remainder that results when the positive integer x is divided by the positive integer y, what is the sum of all the possible values of y such that (16 # y) = 1?

A. 8
B. 9
C. 16
D. 23
E. 24

Is there a quick and easy way to find divisors to an integer/expression when we are looking for a distinct remainders?

23
, I found the answer by calculating and doing several divisions, is there an easier way?

Originally posted by jokkemauritzen on 29 Mar 2014, 13:23.
Last edited by Bunuel on 29 Mar 2014, 13:55, edited 1 time in total.
Renamed the topic, edited the question and added the OA.
Math Expert
Joined: 02 Sep 2009
Posts: 51185
Re: If (x # y) represents the remainder that results when the po  [#permalink]

### Show Tags

29 Mar 2014, 14:02
2
4
jokkemauritzen wrote:
If (x # y) represents the remainder that results when the positive integer x is divided by the positive integer y, what is the sum of all the possible values of y such that (16 # y) = 1?

A. 8
B. 9
C. 16
D. 23
E. 24

Is there a quick and easy way to find divisors to an integer/expression when we are looking for a distinct remainders?

23
, I found the answer by calculating and doing several divisions, is there an easier way?

(x # y) represents the remainder that results when the positive integer x is divided by the positive integer y.

Thus (16 # y) = 1 implies that $$16=yq+1$$ --> $$15=yq$$ --> y is a factor of 15. The factors of 15 are 1, 3, 5, and 15. Now, y cannot be 1, since 16 divided by 1 yields the remainder of 0 not 1.

Therefore the sum of all the possible values of y is 3+5+15=23.

_________________
##### General Discussion
Non-Human User
Joined: 09 Sep 2013
Posts: 9150
Re: If (x # y) represents the remainder that results when the po  [#permalink]

### Show Tags

16 Dec 2017, 05:05
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.
_________________
Re: If (x # y) represents the remainder that results when the po &nbs [#permalink] 16 Dec 2017, 05:05
Display posts from previous: Sort by