Maths Olympiad Prep

Library / /376 of 520

Number theory Difficulty 6.4 National olympiad Prove it

Lemma 2 Let 0<a<b0<a<b, and (a,b)=1(a, b)=1. If ab\frac{a}{b} can be expressed as a pure repeating decimal, then we have (b,10)=1(b, 10)=1.

Solution

Proof: If ab\frac{a}{b} can be expressed as a pure repeating decimal, then by 0<ab<10<\frac{a}{b}<1 and Definition 2, we have
ab=0.a1ata1ata1at\frac{a}{b}=0 . a_{1} \cdots a_{t} a_{1} \cdots a_{t} a_{1} \cdots a_{t} \cdots

where a1,,ata_{1}, \cdots, a_{t} are non-negative integers no greater than 9, but at least one ai1a_{i} \geqslant 1 in a1,,ata_{1}, \cdots, a_{t}. Therefore,
10iab=10t1a1++at+0.a1ata1ata1at\frac{10^{i} a}{b}=10^{t-1} a_{1}+\cdots+a_{t}+0 . a_{1} \cdots a_{t} a_{1} \cdots a_{t} a_{1} \cdots a_{t} \cdots

Subtracting (2) from (3) yields
10tabab=10t1a1++ai\frac{10^{t} a}{b}-\frac{a}{b}=10^{t-1} a_{1}+\cdots+a_{i}, hence we get
a(10t1)=b(10t1a1++at)a\left(10^{t}-1\right)=b\left(10^{t-1} a_{1}+\cdots+a_{t}\right)

Since 10t1a1++ai10^{t-1} a_{1}+\cdots+a_{i} is a positive integer, (a,b)=1(a, b)=1 and (4), we have
10t1=bm10^{t}-1=b m

where mm is an integer. By (b,1)=1(b, 1)=1 and (5), we have (b,10t)=\left(b, 10^{t}\right)= 1, thus (b,10)=1(b, 10)=1.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.