Which integers can be multiplied by another integer so the product is in the form of 999....999?
To answer this question, will use some concepts, though I don't have a rigorous proof of these(I will update this note if I find something), a irreducible fraction:
1) Will only have terminating decimals if the denominator can be written as product of powers of two and five;
"Proof": 2a×5bn=2a×5bn×10c10c=10cn×2c−a×5c−b, with c=max(a,b)
2) Will only have non-terminating decimals if the denominator is not a multiple of two and five, but is a multiple of another prime number;
3) Will have both terminating(non-repeating) and non-terminating decimals if the denominator is a multiple of 2 or 5, and is a multiple of another prime;
I will use the second case; It is possible to revert it back to a fraction:
0.(part that repeats)=a sequence of 9 with the same number of digits as the part that repeatspart that repeats
So there is a way to transform a(irreducible) fraction whose denominator is not a multiple of two and five to a fraction whose denominator is a sequence of nines
n1=99...999a if n is not a multiple of 2 nor 5(if n=1(not a multiple of another prime) then it is trivial)
n=a99...999
n×a=99...999
With this, I can, for instance, find the number that, multiplied by 17, will return a sequence of nines:
171=0.0588235294117647=9999999999999999588235294117647
17=5882352941176479999999999999999
17×588235294117647=9999999999999999
#NumberTheory
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Every integers except those divisible by 2 and 5, can be multiplied in such a way.
For any integer q ,
Consider order of 10(modq),
denote it k .
Then 10k≡1⇒99999.....9≡0(modq)
But we can generalise the result, to For any integer q,
Let α,β be the maximum power of 2,5 dividing q respectively.
Then there always exists a number 999...9990000.....000 with number of zero =max(α,β).
Log in to reply
Well, actually, you can generalize even more, when you consider another base system, here I used another way Euler Theorem to make this more rigorous: https://brilliant.org/discussions/thread/divisors-of-9999999-in-the-right-way/?ref_id=1339441