N = a n a n − 1 a n − 2 . . . a 2 a 1 a 0 n + 1 digits ⇕ N = 1 0 n a n + 1 0 n − 1 a n − 1 + 1 0 n − 2 a n − 2 + ⋯ + 1 0 2 a 2 + 1 0 a 1 + a 0
Let N be a positive integer as defined above.
A certain kind of positive integer χ exists such that
χ N = χ a n a n − 1 a n − 2 . . . a 2 a 1 a 0 n + 1 digits = 0 . a n a n − 1 a n − 2 . . . a 2 a 1 a 0
What is χ ?
Details and Assumptions:
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Take a look at (this)[https://brilliant.org/problems/decimal-integers]. Same question asked in a different way with good solution
χ N ⟹ 1 0 n + 1 × χ N = 0 . a n a n − 1 a n − 2 . . . a 2 a 1 a 0 = a n a n − 1 a n − 2 . . . a 2 a 1 a 0 . a n a n − 1 a n − 2 . . . a 2 a 1 a 0 As number of recurring digits is n + 1 ∴ ( 1 0 n + 1 − 1 ) χ N = a n a n − 1 a n − 2 . . . a 2 a 1 a 0 ⟹ ( 1 0 n + 1 − 1 ) χ N = N ⟹ ( 1 0 n + 1 − 1 ) χ 1 = 1 ⟹ χ = 1 0 n + 1 − 1
Log in to reply
Oh, I wasn't aware that you had posted a similar problem like this. Your solution is elaborative and clear. Seth Christman has also posted an elaborate solution to my problem, which has a similar approach but somewhat not exactly the same as yours. I found it much less time consuming and efficient to use my method for solving this problem. +1 for your solution on your problem. :)
Problem Loading...
Note Loading...
Set Loading...
To get a repeating decimal of any pattern you want of finite length, you can multiply your digit x who has n digits by 0 . n − 1 0 0 . . . 0 1 .
This number has enough 0 's to hold your number, and multiplies it by 1, then just keeps concocting them. Now we need to find this number as a fraction.
Lets look at the fraction 9 1 . As a decimal it is 0 . 1 1 1 1 . This is a good baseline, as this 9 x is the 1 digit repeating number fraction.
Lets look at the fraction 1 1 1 . As a decimal it is 0 . 0 9 0 9 . We now have a 2 digit repeating decimal, but we need 1 's, not 9 's. So lets multiply by 9 1 . 1 1 1 × 9 1 = 0 . 0 9 0 9 ÷ 9 = 0 . 0 1 0 1 = 9 9 1 . We can see multiplying this decimal by any 2 digit number would give us the 2 digit repeating decimal. So 9 9 x is the 2 digit repeating fraction. (The pattern is forming).
This pattern does indeed repeat, to get 0 . 0 0 9 0 0 9 you need the fraction 1 1 1 1 . Repeat the steps as above and you get the 3 digit repeat fraction of 9 9 9 1 .
Recapping:
1 digit = 9 1 = 1 0 1 − 1 1
2 digits = 9 9 1 = 1 0 2 − 1 1
3 digits = 9 1 = 1 0 3 − 1 1
…
n digits = 9 1 = 1 0 n − 1 1
n + 1 digits = 9 1 = 1 0 n + 1 − 1 1 . Our number has n + 1 digits, therfore χ = 1 0 n + 1 − 1
P.S. I already had prior knowledge about how repeating decimals worked, so I kind of just described the pattern. Somebody please show the work of deriving 9 1 a n d x 1 1 1 … 1 1 1 1 as the key fractions needed