login
Anomalous prime numbers.
1

%I #13 Jan 25 2022 12:59:29

%S 199,211,283,317,337,389,491,509,547,577,619,683,701,773,787,797,863,

%T 887,1069,1109,1129,1153,1163,1373,1381,1409,1459,1523,1531,1571,1627,

%U 1637,1669,1709,1723,1733,1759,1831,1889,1913,1933,1951,1979,2003,2017

%N Anomalous prime numbers.

%C If x and y are two consecutive prime numbers (x < y), Euclid's algorithm gives integers t and d such that tx+dy = 1 = gcd(x, y). The algorithm "Anomalia" gives t and d such that |t+d| is as small as possible (it is often = 1). The prime number x is 'anomalous' iff |t+d| > 1 for x and y.

%C That is, primes p such that neither q-1 nor q+1 is divisible by q-p, where q is the next prime larger than p. - _Charles R Greathouse IV_, Aug 20 2017

%H Charles R Greathouse IV, <a href="/A106628/b106628.txt">Table of n, a(n) for n = 1..10000</a>

%F Conjecture: a(n) ~ n log n. - _Charles R Greathouse IV_, Aug 20 2017

%e a(1) = 199 because -88*199+83*211 = 1, |-88+83| = 5 > 1;

%e |tx+dy| = 1 for all primes x < 199 (when t and d are determined by the algorithm "Anomalia")

%o {ALGORITHM "Anomalia" in pseudo language} INPUT x, y {positive integers} m := x, n := y, b := 0, d := 1, p := 1, t := 0 WHILE m <> 0 DO q := n DIV m h := m, m := n-q*m, n := h h := b, b := d-q*b, d := h h := p, p := t-q*p, t := h WRITE - The gcd of the numbers is WRITE n = tx+dy {this is 1 for consecutive primes}

%o (PARI) is(x)=if(!isprime(x), return(0)); my(y=nextprime(x+1),d=y-x); (y-1)%d && (y+1)%d \\ _Charles R Greathouse IV_, Aug 20 2017

%Y Subsequence of A083371.

%K base,nonn

%O 1,1

%A _Pahikkala Jussi_, May 11 2005