---

Development of Algorithmic Constructions

07:53:40 20.Apr 2024

---

Polynom = x^2+36x-229

1. Algorithm

a:=1;
b:=36;
c:=-229;


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+36x-229

f(0)=229
f(1)=3
f(2)=17
f(3)=7
f(4)=23
f(5)=1
f(6)=1
f(7)=1
f(8)=41
f(9)=11
f(10)=1
f(11)=1
f(12)=347
f(13)=1
f(14)=157
f(15)=67
f(16)=1
f(17)=1
f(18)=743
f(19)=1
f(20)=1
f(21)=1
f(22)=349
f(23)=47
f(24)=173
f(25)=1
f(26)=461
f(27)=1
f(28)=521
f(29)=1
f(30)=103
f(31)=1
f(32)=59
f(33)=1
f(34)=239
f(35)=1
f(36)=139
f(37)=1
f(38)=1
f(39)=337
f(40)=937
f(41)=61
f(42)=277
f(43)=1
f(44)=1097
f(45)=1
f(46)=1181
f(47)=1
f(48)=3803
f(49)=1
f(50)=1
f(51)=263
f(52)=1
f(53)=1
f(54)=421
f(55)=199
f(56)=547
f(57)=317
f(58)=1741
f(59)=1
f(60)=5531
f(61)=79
f(62)=1949
f(63)=751
f(64)=1
f(65)=1
f(66)=929
f(67)=1
f(68)=2281
f(69)=877
f(70)=1
f(71)=307
f(72)=7547
f(73)=1
f(74)=293
f(75)=1
f(76)=251
f(77)=353
f(78)=8663
f(79)=1
f(80)=431
f(81)=1
f(82)=1
f(83)=1
f(84)=9851
f(85)=419
f(86)=311
f(87)=1
f(88)=1187
f(89)=227
f(90)=271
f(91)=1
f(92)=1283
f(93)=1471
f(94)=571
f(95)=509
f(96)=541
f(97)=1
f(98)=1
f(99)=821

b) Substitution of the polynom
The polynom f(x)=x^2+36x-229  could be written as f(y)= y^2-553 with x=y-18

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+18
f'(x)>2x+35

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 : 229, 3, 17, 7, 23, 1, 1, 1, 41, 11, 1, 1, 347, 1, 157, 67, 1, 1, 743, 1,
Found in Database : 229, 3, 17, 7, 23, 41, 11, 347, 157, 67, 743, 349, 47, 173, 461, 521, 103, 59, 239, 139, 337,
Found in Database : 3, 7, 11, 17, 23, 41, 47, 59, 61, 67, 79, 103, 139,