---

Development of Algorithmic Constructions

08:15:11 19.Apr 2024

---

Polynom = x^2-28x+37

1. Algorithm

a:=1;
b:=-28;
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-28x+37

f(0)=37
f(1)=5
f(2)=3
f(3)=19
f(4)=59
f(5)=13
f(6)=1
f(7)=11
f(8)=41
f(9)=67
f(10)=1
f(11)=1
f(12)=31
f(13)=79
f(14)=53
f(15)=1
f(16)=1
f(17)=1
f(18)=1
f(19)=1
f(20)=1
f(21)=1
f(22)=1
f(23)=1
f(24)=1
f(25)=1
f(26)=1
f(27)=1
f(28)=1
f(29)=1
f(30)=97
f(31)=1
f(32)=1
f(33)=101
f(34)=241
f(35)=47
f(36)=1
f(37)=1
f(38)=139
f(39)=233
f(40)=1
f(41)=1
f(42)=1
f(43)=1
f(44)=1
f(45)=401
f(46)=173
f(47)=1
f(48)=997
f(49)=1
f(50)=379
f(51)=1
f(52)=257
f(53)=227
f(54)=131
f(55)=761
f(56)=107
f(57)=1
f(58)=1777
f(59)=311
f(60)=103
f(61)=1
f(62)=1
f(63)=1
f(64)=2341
f(65)=1
f(66)=509
f(67)=1
f(68)=919
f(69)=1433
f(70)=229
f(71)=1
f(72)=641
f(73)=151
f(74)=1
f(75)=137
f(76)=1
f(77)=127
f(78)=1
f(79)=1
f(80)=1399
f(81)=433
f(82)=1
f(83)=1
f(84)=431
f(85)=2441
f(86)=1
f(87)=1
f(88)=409
f(89)=911
f(90)=1
f(91)=577
f(92)=1
f(93)=3041
f(94)=1
f(95)=1
f(96)=1
f(97)=673
f(98)=1
f(99)=3533

b) Substitution of the polynom
The polynom f(x)=x^2-28x+37  could be written as f(y)= y^2-159 with x=y+14

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-14
f'(x)>2x-29  with x > 13

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, 5, 3, 19, 59, 13, 1, 11, 41, 67, 1, 1, 31, 79, 53, 1, 1, 1, 1, 1,
Found in Database : 37, 5, 3, 19, 59, 13, 11, 41, 67, 31, 79, 53, 97, 101, 241, 47, 139, 233,
Found in Database : 3, 5, 11, 13, 19, 31, 37, 41, 47, 53, 59, 67, 79, 97, 101, 103, 107, 127, 131, 137, 139,