|
%I #61 Sep 11 2021 21:26:23
%S 5,2,2,53,5,173,2,17,2,29,13,5,1697,53,2,73,13,5,37,2,389,733,2753,89,
%T 17,1093,773,13,397,1789,2,41,821,53,5,29,193,281,6257,173,2,149,593,
%U 701,5,1289,157,5,7993,13,2213,449,877,2,61,37,389,17,5,24061
%N Smallest prime a(n) = x^2 + y^2 such that c^2 + d^2 = A002313(n) and c*x + d*y = 1, where c,d,x,y are integers.
%C Let c^2 + d^2 = p be a prime, A002313(n). Then x^2 + y^2 = q is the smallest prime, a(n), such that cx + dy = 1 (Bézout's identity), where c,d,x,y are integers. We have pq = m^2 + 1 at m = cy - dx.
%C a(n) is the smallest prime q such that q*A002313(n)-1 is a square. - _Thomas Ordowski_, Sep 13 2015
%C Conjecture: a(n) < A002313(n)^2 for n > 1. - _Thomas Ordowski_, Dec 28 2017
%H Robert Israel, <a href="/A244290/b244290.txt">Table of n, a(n) for n = 1..2910</a>
%e For prime 2 = 1^2 + 1^2 is 1*2 + 1*(-1) = 1 and 2^2 + (-1)^2 = 5 is prime, so a(1) = 5. For A002313(2) = 5 is vice versa so a(2) = 2.
%p N:= 10^6: # to get all a(n) before the first one > N
%p P:= select(isprime, [2,seq(4*i+1, i=1..floor((N-1)/4))]):
%p f:= proc(p) local i;
%p for i from 1 to nops(P) do
%p if issqr(p*P[i]-1) then return P[i] fi
%p od:
%p -1
%p end proc:
%p for i from 1 to nops(P) do
%p v:= f(P[i]);
%p if v = -1 then break fi;
%p A[i]:= v;
%p od:
%p seq(A[j],j=1..i-1); # _Robert Israel_, Sep 13 2015
%o (PARI)
%o \\ cs should contain terms from A002330
%o \\ ds should contain terms from A002331
%o a244290(cs, ds) = {
%o vector(#cs, i,
%o c=cs[i]; d=ds[i]; [u,v]=gcdext(c, d);
%o x=u; y=v; while(!isprime(x^2+y^2), x+=d; y-=c); e=x^2+y^2;
%o x=u; y=v; while(!isprime(x^2+y^2), x-=d; y+=c); f=x^2+y^2;
%o min(e, f)
%o )
%o } \\ _Colin Barker_, Jul 06 2014
%Y Cf. A002313, A002330, A002331.
%K nonn
%O 1,1
%A _Thomas Ordowski_, Jun 27 2014
%E More terms from _Colin Barker_, Jul 06 2014
|
