Skip to main content
reformulated criterion
Source Link
Pedja
  • 2.7k
  • 15
  • 26

Can you provide a proof for the following claim:

Let $P_m(x)=2^{-m}\cdot \left(\left(x-\sqrt{x^2-4})^m+(x+\sqrt{x^2-4}\right)^m\right)$ . Let $N= 4kp^n+1 $ such that $p$ is a prime number greater than $3$ , $k$ is an odd natural number , $3 \nmid k$ , $n\ge3$$n\ge1$ and $4k <p^n$. Let $S_i=P_p(S_{i-1})$ with $S_0=P_{kp^2}(10)$$S_0=P_{k}(10)$, then $N$ is a prime iff $S_{n-2} \equiv 0 \pmod{N}$$S_{n} \equiv 0 \pmod{N}$ .

You can run this test herehere. I have verified this claim for $k \in [1,300]$ with $p \in [5,109]$ and $n \in [3,50]$$n \in [1,50]$ .

Can you provide a proof for the following claim:

Let $P_m(x)=2^{-m}\cdot \left(\left(x-\sqrt{x^2-4})^m+(x+\sqrt{x^2-4}\right)^m\right)$ . Let $N= 4kp^n+1 $ such that $p$ is a prime number greater than $3$ , $k$ is an odd natural number , $3 \nmid k$ , $n\ge3$ and $4k <p^n$. Let $S_i=P_p(S_{i-1})$ with $S_0=P_{kp^2}(10)$, then $N$ is a prime iff $S_{n-2} \equiv 0 \pmod{N}$ .

You can run this test here. I have verified this claim for $k \in [1,300]$ with $p \in [5,109]$ and $n \in [3,50]$ .

Can you provide a proof for the following claim:

Let $P_m(x)=2^{-m}\cdot \left(\left(x-\sqrt{x^2-4})^m+(x+\sqrt{x^2-4}\right)^m\right)$ . Let $N= 4kp^n+1 $ such that $p$ is a prime number greater than $3$ , $k$ is an odd natural number , $3 \nmid k$ , $n\ge1$ and $4k <p^n$. Let $S_i=P_p(S_{i-1})$ with $S_0=P_{k}(10)$, then $N$ is a prime iff $S_{n} \equiv 0 \pmod{N}$ .

You can run this test here. I have verified this claim for $k \in [1,300]$ with $p \in [5,109]$ and $n \in [1,50]$ .

extended upper bound for tested values of p
Source Link
Pedja
  • 2.7k
  • 15
  • 26

Can you provide a proof for the following claim:

Let $P_m(x)=2^{-m}\cdot \left(\left(x-\sqrt{x^2-4})^m+(x+\sqrt{x^2-4}\right)^m\right)$ . Let $N= 4kp^n+1 $ such that $p$ is a prime number greater than $3$ , $k$ is an odd natural number , $3 \nmid k$ , $n\ge3$ and $4k <p^n$. Let $S_i=P_p(S_{i-1})$ with $S_0=P_{kp^2}(10)$, then $N$ is a prime iff $S_{n-2} \equiv 0 \pmod{N}$ .

You can run this test here. I have verified this claim for $k \in [1,300]$ with $p \in [5,71]$$p \in [5,109]$ and $n \in [3,50]$ .

Can you provide a proof for the following claim:

Let $P_m(x)=2^{-m}\cdot \left(\left(x-\sqrt{x^2-4})^m+(x+\sqrt{x^2-4}\right)^m\right)$ . Let $N= 4kp^n+1 $ such that $p$ is a prime number greater than $3$ , $k$ is an odd natural number , $3 \nmid k$ , $n\ge3$ and $4k <p^n$. Let $S_i=P_p(S_{i-1})$ with $S_0=P_{kp^2}(10)$, then $N$ is a prime iff $S_{n-2} \equiv 0 \pmod{N}$ .

You can run this test here. I have verified this claim for $k \in [1,300]$ with $p \in [5,71]$ and $n \in [3,50]$ .

Can you provide a proof for the following claim:

Let $P_m(x)=2^{-m}\cdot \left(\left(x-\sqrt{x^2-4})^m+(x+\sqrt{x^2-4}\right)^m\right)$ . Let $N= 4kp^n+1 $ such that $p$ is a prime number greater than $3$ , $k$ is an odd natural number , $3 \nmid k$ , $n\ge3$ and $4k <p^n$. Let $S_i=P_p(S_{i-1})$ with $S_0=P_{kp^2}(10)$, then $N$ is a prime iff $S_{n-2} \equiv 0 \pmod{N}$ .

You can run this test here. I have verified this claim for $k \in [1,300]$ with $p \in [5,109]$ and $n \in [3,50]$ .

Source Link
Pedja
  • 2.7k
  • 15
  • 26

A primality criterion for specific class of $N=4kp^n+1$

Can you provide a proof for the following claim:

Let $P_m(x)=2^{-m}\cdot \left(\left(x-\sqrt{x^2-4})^m+(x+\sqrt{x^2-4}\right)^m\right)$ . Let $N= 4kp^n+1 $ such that $p$ is a prime number greater than $3$ , $k$ is an odd natural number , $3 \nmid k$ , $n\ge3$ and $4k <p^n$. Let $S_i=P_p(S_{i-1})$ with $S_0=P_{kp^2}(10)$, then $N$ is a prime iff $S_{n-2} \equiv 0 \pmod{N}$ .

You can run this test here. I have verified this claim for $k \in [1,300]$ with $p \in [5,71]$ and $n \in [3,50]$ .