BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

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

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Moderator
Posts: 7187
Joined: Thu Sep 07, 2017 4:43 pmFollowed by: 23 members
by BTGmoderatorDC » Fri Apr 19, 2019 4:35 am

Timer

00:00

Answers

A

B

C

D

E

Stats

Difficulty—

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

OA D

Source: Manhattan Prep
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 16207
Joined: Mon Dec 08, 2008 6:26 pmFollowed by: 1268 members
Location: Vancouver, BC
Thanked: 5254 times
GMAT Score:770

by Brent@GMATPrepNow » Fri Apr 19, 2019 5:03 am
BTGmoderatorDC 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
If y > 16, (16 # y) = 16, so we need only check the values from 1 to 15
Also, we need not check the FACTORS of 16, since they will all yield a remainder of 0
We're left with:
(16 # 3) = 1 KEEP!
(16 # 5) = 1 KEEP
(16 # 7) = 2
(16 # 9) = 7
(16 # 10) = 6
(16 # 11) = 5
(16 # 12) = 4
(16 # 13) = 3
(16 # 14) = 2
(16 # 15) = 1 KEEP

3 + 5 + 15 = 23

Answer: D
Brent Hanneson - Creator of GMATPrepNow.com
Image
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 8152
Joined: Sat Apr 25, 2015 10:56 amFollowed by: 29 members
Location: Los Angeles, CA
Thanked: 43 times

by Scott@TargetTestPrep » Fri Apr 26, 2019 2:34 pm
BTGmoderatorDC 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

OA D

Source: Manhattan Prep
16/15 has a remainder of 1.

16/5 has a remainder of 1.

16/3 has a remainder of 1.

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

Alternate Solution:

We are looking for all values of y such that 16 divided by y produces a remainder of 1. Then, 16 - 1 = 15 must be divisible by y. Excluding y = 1 (which produces a remainder of 0); the possibilities for y are 15, 5 and 3. Thus, the sum of all possible values of y is 15 + 5 + 3 = 23.

Answer: D

Scott Woodbury-Stewart
Founder and CEO
[email protected]

Image

See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews

ImageImage
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1