|
%I #25 Jun 28 2018 05:57:38
%S 2,3,4,5,6,8,13,18,19,27,48,50,55,97,111,195,223,342,344,391,447,685,
%T 783,895,1371,1567,1791,2400,2402,2743,3135,3583,4801,5487,6271,7167,
%U 9603,10975,12543,14335,16806,16808,19207,21951,25087,28671,33613,38415,43903,50175
%N Bases in which 7 is a unique-period prime.
%C A prime p is called a unique-period prime in base b if there is no other prime q such that the period length of the base-b expansion of its reciprocal, 1/p, is equal to the period length of the reciprocal of q, 1/q.
%C A prime p is a unique-period prime in base b if and only if Zs(b, 1, ord(b,p)) = p^k, k >= 1. Here Zs(b, 1, d) is the greatest divisor of b^d - 1 that is coprime to b^m - 1 for all positive integers m < d, and ord(b,p) is the multiplicative order of b modulo p.
%C b is a term if and only if: (a) b = 7^t + 1, t >= 1; (b) b = 2^s*7^t - 1, s >= 0, t >= 1; (c) b = 2, 3, 4, 5, 18, 19.
%C For every odd prime p, p is a unique-period prime in base b if b = p^t + 1, t >= 1 or b = 2^s*p^t - 1, s >= 0, t >= 1. These are trivial bases in which p is a unique-period prime, with ord(b,p) = 1 or 2. By Faltings's theorem, there are only finitely many nontrivial bases in which p is also a unique-period prime, with ord(b,p) >= 3. For p = 7, the nontrivial bases are 2, 3, 4, 5, 18, 19.
%H Jianing Song, <a href="/A306075/b306075.txt">Table of n, a(n) for n = 1..448</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Unique_prime">Unique prime</a>
%e 1/7 has period length 3 in base 2. Note that 7 is the only prime factor of 2^3 - 1 = 7, so 7 is a unique-period prime in base 2.
%e 1/7 has period length 3 in base 4. Note that 3, 7 are the only prime factors of 4^3 - 1 = 63, but 1/3 has period length 1, so 7 is a unique-period prime in base 4.
%e 1/7 has period length 3 in base 18. Note that 7, 17 are the only prime factors of 18^3 - 1 = 5831, but 1/17 has period length 1, so 7 is a unique-period prime in base 18.
%e (1/7 has period length 6 in base 3, 5, 19. Similar demonstrations can be found.)
%o (PARI)
%o p = 7;
%o gpf(n)=if(n>1, vecmax(factor(n)[, 1]), 1);
%o test(n, q)=while(n%p==0, n/=p); if(q>1, while(n%q==0, n/=q)); n==1;
%o for(n=2, 10^6, if(gcd(n, p)==1, if(test(polcyclo(znorder(Mod(n, p)), n), gpf(znorder(Mod(n, p)))), print1(n, ", "))));
%Y Cf. A040017 (unique-period primes in base 10), A144755 (unique-period primes in base 2).
%Y Bases in which p is a unique-period prime: A000051 (p=2), A306073 (p=3), A306074 (p=5), this sequence (p=7), A306076 (p=11), A306077 (p=13).
%K easy,nonn
%O 1,1
%A _Jianing Song_, Jun 19 2018
|
