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) = 3?
Correct answer: A
Explanation
16 = ky+3
since -- > 0 <=remainder < divisor
therefore y>1
ky=13 => y =13/k :- possible values of k for y to be +int y=1,13
hence, sum = 14
Loading…
Searched on YouTube by reporting category, not by question text. Open this search on YouTube →
Source: Algebra word problems from the AQuA-RAT dataset (Ling et al., 2017), published by Google DeepMind under the Apache License 2.0.
Go to the official source →
AQuA-RAT items are crowdsourced algebra problems, not ACT questions. They carry five answer choices in the pre-2025 ACT Mathematics style and no ACT reporting category. Useful for drilling Preparing for Higher Math content; not a substitute for a real form.