Difference between revisions of "Mock AIME 6 2006-2007 Problems/Problem 14"
(Created page with "==Problem== A rational <math>\frac{1}{k}</math>, where <math>k</math> is a positive integer, is said to be <math>\textit{n-unsound}</math> if its base <math>N</math> represent...") |
(solution) |
||
Line 3: | Line 3: | ||
==Solution== | ==Solution== | ||
− | {{ | + | Denote the set of distinct primes dividing into <math>k</math> as <math>X</math>. The rational <math>\frac{1}{k}</math> is only terminating in base <math>N</math> if for all members <math>x\in X</math>, we have <math>x|N</math>. As a result, <math>2</math>, <math>4</math>, and <math>8</math> are identical in this respect, for instance, and we can thus reduce the <math>n</math> to: |
+ | <cmath>2,3,5,7,11,13,2\cdot3,2\cdot5,2\cdot7</cmath> | ||
+ | Clearly for each of the primes <math>p</math> in the list above, the sum of all terminating rationals of such a form is | ||
+ | <cmath>\sum_{i=0}^\infty\frac{1}{p^i}=\frac{p}{p-1}</cmath> | ||
+ | Thus the primes <math>2,3,5,7,11,13</math> respectively contribute | ||
+ | <cmath>2,\frac{3}{2},\frac{5}{4},\frac{7}{6},\frac{11}{10},\frac{13}{12}</cmath> | ||
+ | to the total sum. However, each of them overcounts the case <math>k=1</math>, so we must subtract <math>5</math> at the end to account for this. | ||
+ | |||
+ | Next, we consider the three <math>n</math> with multiple distinct prime factors. If we ignore all values already counted above, then the sum of each, for <math>p=3,5,7</math>, is, | ||
+ | <cmath>\sum_{i=1}^\infty\frac{1}{2^i}\cdot\sum_{i=1}^\infty\frac{1}{p^i}=\frac{1}{p-1}</cmath> | ||
+ | Thus the overall sum is | ||
+ | <cmath>2+\frac{3}{2}+\frac{5}{4}+\frac{7}{6}+\frac{11}{10}+\frac{13}{12}-5+\frac{1}{2}+\frac{1}{4}+\frac{1}{6}=\frac{241}{60}</cmath> | ||
+ | The solution is therefore <math>241+60=\boxed{301}</math>. | ||
+ | |||
+ | ~ [https://artofproblemsolving.com/wiki/index.php/User:Eevee9406 eevee9406] |
Latest revision as of 20:33, 29 April 2025
Problem
A rational , where
is a positive integer, is said to be
if its base
representation terminates. Let
be the set of all
rationals. The sum of all the elements in the union set
is
, where
and
are relatively prime positive integers. Find
.
Solution
Denote the set of distinct primes dividing into as
. The rational
is only terminating in base
if for all members
, we have
. As a result,
,
, and
are identical in this respect, for instance, and we can thus reduce the
to:
Clearly for each of the primes
in the list above, the sum of all terminating rationals of such a form is
Thus the primes
respectively contribute
to the total sum. However, each of them overcounts the case
, so we must subtract
at the end to account for this.
Next, we consider the three with multiple distinct prime factors. If we ignore all values already counted above, then the sum of each, for
, is,
Thus the overall sum is
The solution is therefore
.