For some positive integer , the repeating base- representation of the (base-ten) fraction is . What is ?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
A two-digit repeating block in base k equals (2k+3)/(k^2-1); setting this to 7/51 forces 51 to divide k^2-1, which only k = 16 satisfies.
Solution
Let . Multiplying by shifts the repeating block two places: , where . So
We need , i.e. .
Fast route: the right side is a multiple of and , so . Among the choices, is , and only is a multiple of . So ; check , and indeed .
The answer is .
Why this works
The base-ten fact is really in any base , derived by the same shift-and-subtract trick. Once the equation is set up, the divisibility structure ( must divide ) is quicker than expanding a quadratic; the answer choices exist to be tested this way.
Alternative approach
Solve directly: . The discriminant is , so . Alternatively factor as .
The trap
Writing the repeating value as (2k + 3)/k^2 or 23/99 style with the wrong denominator, or solving the quadratic and mis-simplifying.
Common mistakes
- Writing the repeating value as (2k + 3)/k^2 or 23/99 style with the wrong denominator, or solving the quadratic and mis-simplifying.
- Reading as the number instead of .
Techniques
Use the answer choices (mod checks, size, form) to eliminate or select · Set up the equation/formula and compute; no special trick needed