Maths Olympiad Prep

Library / /328 of 520

Number theory Difficulty 6.3 National olympiad Prove it

Lemma 4 Let 10,β>0,(b1,10)=1,b1>110, \beta>0, (b_{1}, 10)=1, b_{1}>1

Suppose the order of 10 modulo b1b_{1} is hh, then
(1) When α=β=0\alpha=\beta=0, ab\frac{a}{b} can be expressed as a pure repeating decimal, and the length of the repeating part is exactly hh, that is
ab=0.a˙1a˙h\frac{a}{b}=0 . \dot{a}_{1} \cdots \dot{a}_{h}
(2) When μ=max(α,β)1\mu=\max (\alpha, \beta) \geqslant 1, ab\frac{a}{b} can be expressed as a mixed repeating decimal, where the non-repeating digits are exactly μ\mu in number, and the length of the repeating part is exactly hh, that is
ab=0.a1aμa˙μ+1a˙μ+h\frac{a}{b}=0 . a_{1} \cdots a_{\mu} \dot{a}_{\mu+1} \cdots \dot{a}_{\mu+h}

Solution

Proof see the same book above, p 26 - 33.
Below we will further study a particularly interesting example.

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.