Primality Criteria for Wagstaff numbers

  • Context: Graduate 
  • Thread starter Thread starter pedja
  • Start date Start date
  • Tags Tags
    Criteria Numbers
Click For Summary
SUMMARY

The discussion focuses on the primality criteria for Wagstaff numbers, defined as \( W_p = \frac{2^p+1}{3} \) for \( p > 3 \). The sequence \( S_0 \) is established based on modular conditions of \( p \), with specific values assigned for different congruences. The conjecture proposed states that \( W_p \) is prime if and only if \( S_{\frac{p-1}{2}} \equiv S_0 \pmod{W_p} \). Clarifications regarding the definition of \( S_0 \) highlight that it is undefined for \( p=3 \) and that the cases are not mutually exclusive, allowing for dual applicability in proving primality.

PREREQUISITES
  • Understanding of Wagstaff numbers and their mathematical formulation
  • Familiarity with modular arithmetic and congruences
  • Knowledge of sequences and recursive definitions in mathematics
  • Basic concepts of primality testing in number theory
NEXT STEPS
  • Research the properties of Wagstaff numbers and their applications in number theory
  • Study modular arithmetic techniques relevant to primality testing
  • Explore recursive sequences and their implications in mathematical proofs
  • Investigate existing primality tests and their effectiveness for specific number forms
USEFUL FOR

Mathematicians, number theorists, and students interested in advanced topics of primality testing and the properties of special number forms like Wagstaff numbers.

pedja
Messages
14
Reaction score
0
\text{Let} ~ W_p ~ \text{be a Wagstaff number of the form :} W_p = \frac{2^p+1}{3}~, \text{where}~p>3
\text {Let's define }~S_0~ \text{as :}
S_0 =<br /> \begin{cases}<br /> 3/2, &amp; \text{if } p \equiv 1 \pmod 4 \\<br /> 11/2, &amp; \text{if } p \equiv 1 \pmod 6 \\<br /> 27/2, &amp; \text{if} ~p \equiv 11 \pmod {12} ~\text{and}~p \equiv 1,9 \pmod {10} \\<br /> 33/2, &amp; \text{if}~ p \equiv 11 \pmod {12} ~\text{and}~p \equiv 3,7 \pmod {10} \\<br /> \end{cases}
\text{Next define sequence}~S_i~\text{as :}
S_i =<br /> \begin{cases}<br /> S_0, &amp; i=0 \\<br /> 8S^4_{i-1}-8S^2_{i-1}+1, &amp; i&gt;0<br /> \end{cases}

\text{How to prove following statement :}
\text{Conjecture :}
W_p=\frac{2^p+1}{3}~\text{is a prime iff}~S_{\frac{p-1}{2}} \equiv S_0 \pmod {W_p}
 
Last edited:
Physics news on Phys.org
Hi, pedja,
I don't have an answer, but it may be easier to get help if you can clear up a bit the definition of S_0: it's undefined for p=3, and the cases are not mutually exclusive.
 
Dodo said:
Hi, pedja,
I don't have an answer, but it may be easier to get help if you can clear up a bit the definition of S_0: it's undefined for p=3, and the cases are not mutually exclusive.

Hi ,
I forgot to point out that p has to be greater than three . I know that first two cases are not mutually exclusive . Both values of S_0 can be used in order to prove primality of corresponding Wagstaff number .
 

Similar threads

  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
6
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K