Let us write 4N explicitly: 4N is a number with 2010 digits, all 4's, so 444⋯444 (2010 digits).
So 4N⋅102010 is the number 444⋯444 (2010 digits) followed by 2010 zeros.
Subtract 4N: ab=444⋯4442010zeros000⋯000−444⋯444
This is the same as writing: 444...444(2010 digits)000...000(2010 zeros)−(000...000444...444)
So, the subtraction is: - The first 2010 digits are 444⋯444 minus 0's, so 444⋯444. - The last 2010 digits are 0's minus 444⋯444.
But since we are subtracting 444⋯444 from 000⋯000, we need to borrow.
Let us perform the subtraction:
Let X=444⋯444000⋯000 (20104's, 20100's), and subtract Y=000⋯000444⋯444 (20100's, 20104's).
So, the result is: - The first 2010 digits: 444⋯444 minus 0's = 444⋯444. - The last 2010 digits: 0's minus 444⋯444 = need to borrow.
Let us look at the last 2010 digits:
Subtracting 444⋯444 from 000⋯000 means that we get 999⋯999−444⋯444+1 (since 10k−x=999⋯999−x+1 for k digits).
So, the last 2010 digits are 999⋯999−444⋯444+1=555⋯555+1=555⋯556 (2010 digits, last digit 6).
But, since we borrowed 1 from the previous digit, the 2010th digit from the left is the last digit of the first 2010 digits, after borrowing 1.
Let us clarify: - The number has 2010+2010=4020 digits (possibly 4019 if there is a leading zero, but in this case, the subtraction does not reduce the number of digits). - The first 2010 digits are 444⋯444 minus 1 (because of the borrow).
So, 444⋯444−1=444⋯443 (the last digit is 3).
Therefore, the first 2009 digits are 4's, and the 2010th digit is 3.
Thus, the 2010th digit of ab is 3.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.