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
5-Day Free Trial
5-day free, full-access trial TTP
Available with Beat the GMAT members only code
MORE DETAILS
Number Theory Problem
This topic has expert replies
-
raunakrajan
- Senior | Next Rank: 100 Posts
- Posts: 62
- Joined: Tue Mar 16, 2010 8:27 am
- Thanked: 1 times
-
amising6
- Master | Next Rank: 500 Posts
- Posts: 294
- Joined: Wed May 05, 2010 4:01 am
- Location: india
- Thanked: 57 times
16#y=1raunakrajan 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
when 16/y you get remainder 1
we can assume 16=n*y+1
15=n*y
so find all the factor of 15
1*15
3*5
so if you divide 16 by 3 ,5 and 15 you will get remainder 1
so sum=3+5+15=23
Ideation without execution is delusion
-
kvcpk
- Legendary Member
- Posts: 1893
- Joined: Sun May 30, 2010 11:48 pm
- Thanked: 215 times
- Followed by:7 members
(16 #15) = 1raunakrajan 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
(16 # 5) =1
(16 # 3) =1
15+5+3 = 23.
Bottom line is 16 will give reminder 1 when divided by any factor of 15. [except 1]
Hope this helps!!
