---

Development of Algorithmic Constructions

08:52:10 16.Apr 2024

---

Polynom = x^2-60x+37

1. Algorithm

a:=1;
b:=-60;
c:=37;


liste_max:=100000;

sieving:=proc (stelle, p)
begin
   while (stelle<=liste_max) do
     erg:=liste[stelle];
     while(erg mod p=0) do
        // Divison of the stored f(x) by the prime
        erg:=erg /p;
     end_while;
     liste[stelle]:=erg;
     stelle:=stelle+p;
   end_while;
end_proc;

// Calculation of the values of the polynom for x from 0 to liste_max
for x from 0 to liste_max do
   p:=abs (a*x^2+b*x+c);
   while (p mod 2=0) p:=p/2;
   liste [x]:=p;
end_for;

for x from 0 to liste_max do
    p:=liste[x];

    if (p>1) then

      // Printing the Primes
      print (x, p);

      // 1. Sieving
      sieving (x+p,  p);

      t:=(-x-b/a) mod p;
      if t=0 then t:=p; end_if;

      // 2. Sieving
      sieving (t, p);

    end_if;

end_for;

 2. Mathematical background
Lemma: If p | f(x) then also p | f(x+p) and  p | f(-x-b/a)

a)  p | f(x)   <=> ax^2 + bx + c = 0                       mod p
    p | f(x+p) <=> a(x+p)^2 + b(x+p) + c = 0               mod p
               <=> ax^2 + 2axp + ap^2 + bx + bp + c = 0    mod p
               <=> ax^2 + bx + c = 0                       mod p

    Thus if p | f(x) then p | f(x+p)

b)  if b = 0 mod a
    p | f(x)       <=> ax^2 + bx + c = 0                         mod p
    p | f(-x-b/a)  <=> a(-x-b/a)^2 + b(-x-b/a) + c = 0           mod p
                   <=> ax^2 + 2bx + b^2/a - bx - b^2/a + c = 0   mod p
                   <=> ax^2 + bx + c = 0                         mod p

    Thus if p | f(x)  then p | f(-x-b/a)



 3. Correctness of the algorithm
The proof for this polynom is similar to the proof for the polynom f(x)=x^2-4x+1.

a) First terms for the polynom f(x) = x^2-60x+37

f(0)=37
f(1)=11
f(2)=79
f(3)=67
f(4)=17
f(5)=7
f(6)=41
f(7)=167
f(8)=379
f(9)=211
f(10)=463
f(11)=251
f(12)=1
f(13)=1
f(14)=607
f(15)=29
f(16)=23
f(17)=347
f(18)=719
f(19)=53
f(20)=109
f(21)=1
f(22)=47
f(23)=1
f(24)=827
f(25)=419
f(26)=1
f(27)=61
f(28)=859
f(29)=431
f(30)=863
f(31)=1
f(32)=1
f(33)=1
f(34)=1
f(35)=1
f(36)=1
f(37)=1
f(38)=1
f(39)=1
f(40)=1
f(41)=1
f(42)=1
f(43)=1
f(44)=1
f(45)=1
f(46)=1
f(47)=1
f(48)=1
f(49)=1
f(50)=1
f(51)=1
f(52)=1
f(53)=1
f(54)=1
f(55)=1
f(56)=1
f(57)=1
f(58)=1
f(59)=1
f(60)=1
f(61)=1
f(62)=1
f(63)=113
f(64)=293
f(65)=181
f(66)=433
f(67)=1
f(68)=83
f(69)=1
f(70)=1
f(71)=409
f(72)=1
f(73)=1
f(74)=1
f(75)=1
f(76)=179
f(77)=673
f(78)=131
f(79)=769
f(80)=1637
f(81)=1
f(82)=263
f(83)=139
f(84)=2053
f(85)=1
f(86)=2273
f(87)=1193
f(88)=1
f(89)=1
f(90)=1
f(91)=1429
f(92)=271
f(93)=1553
f(94)=1
f(95)=1
f(96)=499
f(97)=1
f(98)=3761
f(99)=1949

b) Substitution of the polynom
The polynom f(x)=x^2-60x+37  could be written as f(y)= y^2-863 with x=y+30

c) Backsubstitution

Beside by backsubstitution you get an estimation for the huge of the primes with p | f(x) and p < f(x)

f'(y)>(2y-1) with with y=x-30
f'(x)>2x-61  with x > 29

4. Infinity of the sequence

5. Sequence of the polynom with 1

6. Sequence of the polynom (only primes)

7. Distribution of the primes

8. Check for existing Integer Sequences by OEIS

Found in Database : 37, 11, 79, 67, 17, 7, 41, 167, 379, 211, 463, 251, 1, 1, 607, 29, 23, 347, 719, 53,
Found in Database : 37, 11, 79, 67, 17, 7, 41, 167, 379, 211, 463, 251, 607, 29, 23, 347, 719, 53, 109, 47, 827, 419, 61, 859, 431, 863,
Found in Database : 7, 11, 17, 23, 29, 37, 41, 47, 53, 61, 67, 79, 83, 109, 113, 131, 139, 149,