---

Development of Algorithmic Constructions

08:36:43 18.Apr 2024

---

Polynom = x^2-40x-73

1. Algorithm

a:=1;
b:=-40;
c:=-73;


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-40x-73

f(0)=73
f(1)=7
f(2)=149
f(3)=23
f(4)=31
f(5)=1
f(6)=277
f(7)=19
f(8)=47
f(9)=11
f(10)=373
f(11)=1
f(12)=409
f(13)=53
f(14)=1
f(15)=1
f(16)=457
f(17)=29
f(18)=67
f(19)=59
f(20)=43
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)=1
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)=103
f(45)=1
f(46)=1
f(47)=1
f(48)=311
f(49)=1
f(50)=61
f(51)=1
f(52)=1
f(53)=1
f(54)=683
f(55)=1
f(56)=823
f(57)=1
f(58)=971
f(59)=131
f(60)=1
f(61)=151
f(62)=1291
f(63)=1
f(64)=1
f(65)=97
f(66)=1
f(67)=1
f(68)=1831
f(69)=241
f(70)=2027
f(71)=1
f(72)=1
f(73)=1
f(74)=349
f(75)=1
f(76)=2663
f(77)=347
f(78)=1
f(79)=1
f(80)=1
f(81)=1
f(82)=3371
f(83)=1
f(84)=3623
f(85)=1
f(86)=353
f(87)=251
f(88)=593
f(89)=1
f(90)=233
f(91)=571
f(92)=673
f(93)=607
f(94)=5003
f(95)=1
f(96)=5303
f(97)=1
f(98)=181
f(99)=1

b) Substitution of the polynom
The polynom f(x)=x^2-40x-73  could be written as f(y)= y^2-473 with x=y+20

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-20
f'(x)>2x-41  with x > 22

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 : 73, 7, 149, 23, 31, 1, 277, 19, 47, 11, 373, 1, 409, 53, 1, 1, 457, 29, 67, 59,
Found in Database : 73, 7, 149, 23, 31, 277, 19, 47, 11, 373, 409, 53, 457, 29, 67, 59, 43,
Found in Database : 7, 11, 19, 23, 29, 31, 43, 47, 53, 59, 61, 67, 73, 97, 103, 131, 149,