|
%I #16 Oct 15 2020 16:35:59
%S 17,31,41,43,73,89,97,109,113,127,137,151,157,193,223,229,233,241,251,
%T 257,277,281,283,307,313,331,337,353,397,401,409,431,433,439,449,457,
%U 499,521,569,571,577,593,601,617,631,641,643,673,683,691,727,733,739,761,769,809,811,857,881,911,919
%N All odd primes a(n) such that for all odd primes q smaller than a(n) the order of 2 modulo a(n)*q is a proper divisor of phi(a(n)*q)/2. The totient function phi is given in A000010.
%C This sequence was inspired by A269454 submitted by _Marina Ibrishimova_.
%C It seems that if for an odd prime p > 3 the order(2, p*3) < phi(p*3)/2 = p-1 then p is in this sequence.
%C Note that 2^(phi(p*q)/2) == 1 (mod p*q) for distinct odd primes p and q, due to Nagell's corollary on Theorem 64, p. 106. The products of distinct primes considered in the present sequence have order of 2 modulo p*q smaller than phi(p*q)/2.
%C Up to and including prime(100) = 541 the only odd primes p such that for all odd primes q smaller than p the order of 2 modulo p*q equals phi(p*q)/2 are 5, 7, and 11.
%H Michael De Vlieger, <a href="/A268923/b268923.txt">Table of n, a(n) for n = 1..1000</a>
%H Wolfdieter Lang, <a href="https://arxiv.org/abs/2008.04300">On the Equivalence of Three Complete Cyclic Systems of Integers</a>, arXiv:2008.04300 [math.NT], 2020.
%e n=1: Order(2, 17*3) = 8, and 8 is a proper divisor of phi(17*3)/2 = 16;
%e order(2, 17*5) = 8, and 8 is a proper divisor of phi(17*5)/2 = 32;
%e order(2, 17*7) = 24, and 24 is a proper divisor of phi(17*7)/2 = 48;
%e order(2, 17*11) = 40, and 40 is a proper divisor of phi(17*11)/2 = 80;
%e order(2, 17*13) = 24, and 24 is a proper divisor of phi(17*13)/2 = 96.
%t Select[Prime@ Range[3, 157], Function[p, AllTrue[Prime@ Range[2, PrimePi@ p - 1], Function[q, With[{e = EulerPhi[p q]/2}, And[Divisible[e, #], # != e]] &@ MultiplicativeOrder[2, p q]]]]] (* _Michael De Vlieger_, Apr 01 2016, Version 10 *)
%Y Cf. A000010, A002326, A269454.
%K nonn
%O 1,1
%A _Wolfdieter Lang_, Apr 01 2016
%E More terms from _Michael De Vlieger_, Apr 01 2016
|
