Lemma 4 Let 10,β>0,(b1,10)=1,b1>1
Suppose the order of 10 modulo b1 is h, then
(1) When α=β=0, ba can be expressed as a pure repeating decimal, and the length of the repeating part is exactly h, that is
ba=0.a˙1⋯a˙h
(2) When μ=max(α,β)⩾1, ba can be expressed as a mixed repeating decimal, where the non-repeating digits are exactly μ in number, and the length of the repeating part is exactly h, that is
ba=0.a1⋯aμa˙μ+1⋯a˙μ+h
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.