Maths Olympiad Prep

Track / Stage 7 / 101 of 300 #1501 of 1964

Problem 1501

National olympiad second round; IMO P1/P4
Number theory Difficulty 7.1 Prove it

4. N4 (FRA) Denote by SS the set of all primes pp such that the decimal representation of 1/p1 / p has its fundamental period divisible by 3. For every pSp \in S such that 1/p1 / p has its fundamental period 3r3 r one may write 1/p=1 / p= 0.a1a2a3ra1a2a3r0 . a_{1} a_{2} \ldots a_{3 r} a_{1} a_{2} \ldots a_{3 r} \ldots, where r=r(p)r=r(p); for every pSp \in S and every integer k1k \geq 1 define f(k,p)f(k, p) by
f(k,p)=ak+ak+r(p)+ak+2r(p) f(k, p)=a_{k}+a_{k+r(p)}+a_{k+2 r(p)}
(a) Prove that SS is infinite.
(b) Find the highest value of f(k,p)f(k, p) for k1k \geq 1 and pSp \in S.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

4. (a) The fundamental period of p p is the smallest integer d(p) d(p) such that p10d(p)1 p \mid 10^{d(p)}-1 . Let s s be an arbitrary prime and set Ns=102s+10s+1 N_{s}=10^{2 s}+10^{s}+1 . In that case Ns3(mod9) N_{s} \equiv 3 \pmod{9} . Let ps37 p_{s} \neq 37 be a prime dividing Ns/3 N_{s} / 3 . Clearly ps3 p_{s} \neq 3 . We claim that such a prime exists and that 3d(ps) 3 \mid d(p_{s}) . The prime ps p_{s} exists, since otherwise Ns N_{s} could be written in the form Ns=337k3(mod4) N_{s}=3 \cdot 37^{k} \equiv 3 \pmod{4} , while on the other hand for s>1 s > 1 we have Ns1(mod4) N_{s} \equiv 1 \pmod{4} . Now we prove 3d(ps) 3 \mid d(p_{s}) . We have psNs103s1 p_{s} \mid N_{s} \mid 10^{3 s}-1 and hence d(ps)3s d(p_{s}) \mid 3 s . We cannot have d(ps)s d(p_{s}) \mid s , for otherwise ps10s1ps(102s+10s+1,10s1)=3 p_{s} \mid 10^{s}-1 \Rightarrow p_{s} \mid (10^{2 s} + 10^{s} + 1, 10^{s} - 1) = 3 ; and we cannot have d(ps)3 d(p_{s}) \mid 3 , for otherwise ps1031=999=3337 p_{s} \mid 10^{3}-1 = 999 = 3^{3} \cdot 37 , both of which contradict ps3,37 p_{s} \neq 3, 37 . It follows that d(ps)=3s d(p_{s}) = 3 s . Hence for every prime s s there exists a prime ps p_{s} such that d(ps)=3s d(p_{s}) = 3 s . It follows that the cardinality of S S is infinite. (b) Let r=r(s) r = r(s) be the fundamental period of pS p \in S . Then p103r1 p \mid 10^{3 r} - 1 , p10r1p102r+10r+1 p \nmid 10^{r} - 1 \Rightarrow p \mid 10^{2 r} + 10^{r} + 1 . Let xj=10j1p x_{j} = \frac{10^{j-1}}{p} and yj={xj}=0.ajaj+1aj+2 y_{j} = \{ x_{j} \} = 0.a_{j} a_{j+1} a_{j+2} \ldots . Then aj<10yj a_{j} < 10 y_{j} , and hence
f(k,p)=ak+ak+r+ak+2r<10(yk+yk+r+yk+2r). f(k, p) = a_{k} + a_{k+r} + a_{k+2 r} < 10 (y_{k} + y_{k+r} + y_{k+2 r}).
We note that xk+xk+s(p)+xk+2s(p)=10k1Npp x_{k} + x_{k+s(p)} + x_{k+2 s(p)} = \frac{10^{k-1} N_{p}}{p} is an integer, from which it follows that yk+yk+s(p)+yk+2s(p)N y_{k} + y_{k+s(p)} + y_{k+2 s(p)} \in \mathbb{N} . Hence yk+yk+s(p)+yk+2s(p)2 y_{k} + y_{k+s(p)} + y_{k+2 s(p)} \leq 2 . It follows that f(k,p)<20 f(k, p) < 20 . We note that f(2,7)=4+8+7=19 f(2, 7) = 4 + 8 + 7 = 19 . Hence 19 is the greatest possible value of f(k,p) f(k, p) .

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.