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.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

If (x # y) represents the remainder that results when the po [#permalink]
20 Feb 2008, 08:22

2

This post was BOOKMARKED

00:00

A

B

C

D

E

Difficulty:

35% (medium)

Question Stats:

68% (01:55) correct
32% (01:07) wrong based on 111 sessions

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?

Re: If (x # y) represents the remainder that results when the [#permalink]
13 May 2014, 06:28

Answer: D 16 = ky+1 since -- > 0 <=remainder < divisor therefore y>1 ky=15 => y =15/k :- possible values of k for y to be +int = 1,3,5 => y=15,5,3 hence, sum = 15+5+3 = 23

Re: If (x # y) represents the remainder that results when the po [#permalink]
13 May 2014, 06:35

1

This post received KUDOS

Expert's post

1

This post was BOOKMARKED

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

(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.

I couldn’t help myself but stay impressed. young leader who can now basically speak Chinese and handle things alone (I’m Korean Canadian by the way, so...