Brian was bored. However, he liked multiplying and dividing numbers. Somehow, he ended up dividing ( 9 9 X 9 9 ) 1 0 0
To his surprise, he found an orderly digit 0.010203040506070809101112131415.......
He went to his math teacher, and without a basis, claimed that the digits after decimal point would have all consecutive two digited number from 01, 02, 03, ..., 96, 97, 98, and 99, and afterwards, would restart the counting again from 00, 01, 02, 03, and so on.
Is Brian correct?
If Brian is correct, answer 7777
If Brian is wrong, and there is a single two-digited number missing from the digits after decimal, write the two-digited missing number. For example, if it's missing number 13, write 13. I have mentioned that there are all the digits from 01 to 09, so there is no need to consider the possibility of the first number being zero.
If Brian is wrong and there are more than one two-digited numbers missing, concatenate the digits in order, for example, if Brian's number doesn't have 17 and 87, write 1787
If the resulting digits after decimal is very disordered, write 9999
If you like the problem, you can see the next problem of similar theme here: W r o n g t h r e e d i g i t s
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.
from here we know that B 2 = 0 . 0 2 0 3 0 4 . . . 9 7 9 9 0 . . . = 9 9 2 1 9 9 ⇒ 1 . 0 2 0 3 0 4 . . . 9 7 9 9 0 . . . = 9 9 2 1 9 9 + 1 = 9 9 2 1 0 0 2 ⇒ 0 . 0 1 0 2 0 3 0 4 . . . 9 7 9 9 0 . . . = 9 9 × 9 9 1 0 0 ∵ 9 8 i s n o t i n 9 9 × 9 9 1 0 0 t h e a n s w e r i s 9 8
Bonus problem: b a = 0 . 0 1 0 2 0 3 0 4 . . . 9 7 9 8 9 9 0 0 0 1 . . . , a , b ∈ N , g cd ( a , b ) = 1 find a , b and also do this for general digits (in the case it is for 2 digits only)
Log in to reply
after the 99 is it 990102 or 99 00 0102?
I feel like with 00 the number has a more rigid pattern
Let a = 100/99. We can easily see that a= 1.0101010101... and a/100 = 0.01010101010101...
Let b= a/99 , which is the number Brian is working on.
99b = a
100b = a + b
b = a/100 + b/100
Replace b on the right hand side with a/100 + b/100, we get
b = a/100 + a/10000 + b/10000
If we repeat the step until reaching near infinity, we'll get..
b = a/100 + a/10000 + a/1000000 + a/100000000 + ....
If we write it in decimal, we can see that
b =
0.01010101010101... +
0.00010101010101... +
0.00000101010101... +
0.00000001010101... + ....
= 0.0102030405060708.....
However, there is a problem with Brian's assumption. The resulting sum of this equation in the 199th and 200th place after decimal cannot be assumed as a reset toward ..00.. , but rather, it's actually ..100... giving an extra 1 to 198th digit. Although the 197th and 198th digit is a sum result of ..01.. 99 times, it also receive an extra 1 from the sum of the next digit, and thus, it also becomes ..100.. It gives an extra 1 to 196th digit. Thus, although digit number 195th and 196th are supposedly 98, since it receives the extra 1 from the next adjacent digit, it becomes 99. The number becomes..
b=0.0102030405.....9495969799000102030405060708.....
Okay so, Brian has a number N=100/99². And without any basis he claims it to be another number S=0.0102....99000102...and so on. We have to confirm whether S=N or not.
S=1/100+2/100²+...99/100⁹⁹+1/100¹⁰¹...and so on =(1/100+2/100²+...99/100⁹⁹)×(1+1/100+1/100²+...).
This expression is written based on the repetitive nature of S. So, we have written S as product of 2 numbers, first is a finite AGP, second is an infinite GP. After calculating, S=(1-(100×99/100¹⁰⁰-1))×(100/99²) which not the same as N. Thus Brian was wrong.
Now all we left to find is the missing 2digit numbers. Let r=1/100. Then, N=r/(1-r)².
Consider 2 numbers 0<a,b<1.
1/(1-a)=1+a+a²+a³+......... 1/(1-b)=1+b+b²+b³+........ Subtract the 2 equations,
(a-b)/((1-a)(1-b))=(a-b)+(a²-b²)+(a³-b³)+...... 1/(1-a)(1-b)=1+(a+b)+(a²+ab+b²)+(a³+a²b+ab²+b³)+..........
Put a=b=r, and we have 1/(1-r)²=1+2r+3r²+........
Here, there's one problem, we have put a=b=r after canceling factor (a-b) from both sides which implies a cannot be equal to b, thus we have violated that condition. In order to counter that problem, we can do this: take a=r,b=r+h, h>0. Thus, now there's no violation of any condition but we have a new variable h to take care of. For that, what we can do is take h to be a very small positive number. As we keep taking smaller and smaller values of h(ie, taking the limit of h from right), h will almost become 0, and disappear from the equation and we will have our result. It might seem like an invalid method for those who are not familiar with the concept of limits and have no knowledge in calculus. Moving on, now we can write N=r/(1-r)²=r(1+2r+3r²+...) =r+2r²+3r³+... Consider the terms 98/100⁹⁸+99/100⁹⁹+100/100¹⁰⁰ =98/100⁹⁸+99/100⁹⁹+1/100⁹⁹= 98/100⁹⁸+100/100⁹⁹ =99/100⁹⁸. So in the 98th position we will find 99. Thus 98 has disappeared from our number. Thus the answer is 98.
Use the generalized geometric series:
k = 0 ∑ ∞ ( k k + n ) q k = ( 1 − q ) n + 1 1 , ∣ q ∣ < 1 , n ∈ N ( ∗ )
Let Brian's number be X . Then we may rewrite it as X = 9 9 2 1 0 0 = ( 1 0 0 − 1 ) 2 1 0 0 = ( 1 − 1 0 − 2 ) 2 1 0 − 2 ( ∗ ) = 1 0 − 2 k = 0 ∑ ∞ ( k k + 1 ) 1 0 − 2 k = k = 1 ∑ ∞ k 1 0 − 2 k = : k = 1 ∑ ∞ a k ∣ ∣ ∣ ∣ ∣ k ′ k ′ : = k + 1 , → k If we only consider the first 9 9 elements, we have no overlaps. But when we add a 1 0 0 , we have an overlap: k = 1 ∑ 1 0 0 a k = k = 1 ∑ 9 9 a k + 1 0 0 ⋅ 1 0 − 2 0 0 = 0 . 0 1 … 9 7 9 8 9 9 + 0 . 0 0 ⋯ 0 0 0 0 0 1 = 0 . 0 1 … 9 7 9 9 0 0 We notice the number 9 8 has changed to 9 9 : The number 9 8 is now missing! However, we do not know yet if the remainder of the series might grow big enough to change even more of the first 1 9 8 digits after the decimal. To prove it doesn't, we need to show ∣ ∣ ∣ ∣ ∣ k = 1 0 1 ∑ ∞ a k ∣ ∣ ∣ ∣ ∣ < 1 0 − 1 9 8 Let's try to find an upper estimate for the remainder: ∣ ∣ ∣ ∣ a k a k + 1 ∣ ∣ ∣ ∣ = k k + 1 ⋅ 1 0 − 2 ≤ 1 0 1 1 0 2 ⋅ 1 0 − 2 = : r < 2 1 for k ≥ 1 0 1 ⇒ ∣ a k ∣ ≤ ∣ a 1 0 1 ∣ r k − 1 0 1 for k ≥ 1 0 1 ( ∗ ∗ ) With these estimates, we can manage the remainder: 0 ≤ ∣ ∣ ∣ ∣ ∣ k = 1 0 1 ∑ ∞ a k ∣ ∣ ∣ ∣ ∣ Δ − Ineq. ≤ k = 1 0 1 ∑ ∞ ∣ a k ∣ ≤ ∣ a 1 0 1 ∣ k ? 1 0 1 ∑ ∞ r k − 1 0 1 = 1 0 1 ⋅ 1 0 − 2 0 2 ⋅ 1 − r 1 ( ∗ ∗ ) < 1 0 1 ⋅ 1 0 − 2 0 2 ⋅ 2 < 1 0 − 1 9 8 The remainder of the series leaves the first 1 9 8 digits unchanged, so the only missing two-digit number is indeed 9 8
Problem Loading...
Note Loading...
Set Loading...
The number is equal to ( 9 9 1 0 ) 2 = ( 0 . 1 0 1 . . . ) 2 .
Writing this out like a standard decimal multiplication, it becomes clear that his is equal to 1 0 0 1 + 1 0 0 0 0 2 + . . . + 1 0 2 n n + . . . .
When n > = 1 0 0 , adding up the terms is not merely concatenating the two-digit numbers anymore, we also get a carry : the 1 of the 100 adds up to 99, which again gives a carry that changes 98 into 99. Ergo just the two-digit sequence 9 8 is missing.