ON WAGSTAFF PRIME

INTRODUCTION
Wagstaff primes are a fascinating class of prime number that have a
unique relationship with both Messene primes and Fermat primes.
These special primes, first discover by mathematician Samuel
wagstaff Jr. In the 1970s, exhibit intriguing mathematical properties
that have captivated number theories and computational
researchers alike. In this presentation, we will explore the intricate
connections between Wagstaff primes and these other notable
prime families, delving into their defining characteristics,
computational aspects, and potential applications.
 RATIONALE
A Wagstaff prime is a special type of prime number that arises
from a specific mathematical expression involving powers of
two. These primes are particularly rare and are defined by
certain conditions on the exponent used in their formation.

Also Wagstaff Prime is Prime in the form :

2𝑝 + 1
𝑊𝑝 =
3
where p must be an odd prime number.
 STATEMENT OF THE PROBLEM
The main objective of the study is to present
and determine the relationship between other
types of Prime. Specifically, this study aims to
answer the following questions:

1. What is Wagstaff Prime ?

2.What are the properties/theorem of

Wagstaff Prime ?

3. How is the Wagstaff Prime related to:

3.1 Mersenne Prime
3.2 Fermat’s Prime
PROPERTIES/ THEOREMS
THEOREMS
Theorem 1.1
Wagstaff prime numbers are built from the sum of the exponentials odd of 2 from p-2 to p=0.

Theorem 1.2
Wagstaff prime numbers can also be interpreted as a repunit prime of base (-2).

(−2)𝑝 +1 2𝑝 + 1
= ; 𝑝 𝑚𝑢𝑠𝑡 𝑏𝑒 𝑜𝑑𝑑 𝑝𝑟𝑖𝑚𝑒
−2 − 1 3

Theorem 1.
Wagstaff prime numbers are infinite.
 RELATIONSHIP

MERSENNE PRIME FERMAT PRIME

it is a prime number of the form
𝑀𝑝 = 2𝑝 − 1
for some integer p.
A number of the form
𝑛
𝐹𝑛 = 22 + 1; 𝑛 ≥ 0 ;
is called a Fermat number.

APPLICATION
1. CRYPTOGRAPHY
2. NUMBER THEORY
3. COMPUTATIONAL MATHEMATICS
4. PURE MATHEMATCIS
 REFERENCES:
1. https://www.youtube.com/watch?v=MAoUkhoT-sM
2. https://vixra.org/pdf/1904.0033v1.pdf
3. https://en.wikipedia.org/wiki/Wagstaff_prime
4. https://mathworld.wolfram.com/WagstaffPrime.html
5. https://cs.uwaterloo.ca/journals/JIS/VOL13/Luca/luca33
.pdf
6. https://www.researchgate.net/publication/359176247_
Solving_the_construction_of_Wagstaff_primes
7. https://www.researchgate.net/publication/359176247_
Solving_the_construction_of_Wagstaff_primes\
8. https://www.casioeducation.com.au/wp-
content/uploads/2020/06/A-Prime-
Experience_CP.pdf
9. http://www.prothsearch.com/fermat.html
10. https://www.physicsforums.com/threads/primality-
criteria-for-wagstaff-numbers.586253/
ON ORE HARMONIC NUMBER
INTRODUCTION
The concept of the harmonic numbers extends beyond the realm of
integers; we have what are known as the Ore harmonic numbers.
These numbers, named after Øystein Ore, a Norwegian
mathematician.

Ore harmonic numbers exhibit relationships and behaviors that

extend beyond simple arithmetic, often leading to deeper insights
into the nature of numbers and their interactions. Exploring the
properties of Ore harmonic numbers can uncover hidden patterns
and connections within mathematical structures, enriching our
understanding of the mathematical universe.
 RATIONALE
In mathematics, a harmonic divisor number or Ore number is
a positive integer whose divisors have a harmonic mean that is
an integer.
𝑛 𝑛
𝐻𝑛 = =
1 1 1 1 𝑛 1
𝑥1 + 𝑥2 + 𝑥3 + ⋯ 𝑥𝑛 𝑖=1 𝑥
𝑖
Whereas,
𝐻𝑛 𝑖𝑠 𝐻𝑎𝑟𝑚𝑜𝑛𝑖𝑐 𝑀𝑒𝑎𝑛
𝑛 𝑖𝑠 𝑡ℎ𝑒 𝑡𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑓𝑎𝑐𝑡𝑜𝑟𝑠 or observations
𝑥1 𝑖𝑠 𝑡ℎ𝑒 𝑓𝑎𝑐𝑡𝑜𝑟𝑠 or observations
𝑥𝑛 is the factors or observation to the nth term
Generally a number is Ore Harmonic Number if the
𝐻𝑚 = ℤ
STATEMENT OF THE PROBLEM
This study aims to provide insights into the
underlying structure and distributional
properties of boundaries between Harmonic
Divisor Number. Specifically. it sought to
answer the following questions;

1. What is Ore Harmonic Number?

2. What are the properties of Ore Harmonic
Number?
3. How Ore Harmonic Number related to
Harmonic Sequence ?
PROPERTIES/ THEOREMS
Thereoms
Theorem 1.1
Perfect Number is an Ore Harmonic Number
𝐿𝑒𝑡 𝑛 ∈ ℤ>0 be a perfect number
then , 𝑛 is an Ore Harmonic Number
𝑃𝑅𝑂𝑂𝐹 ∶
𝑤ℎ𝑒𝑟𝑒 ∶
𝑛 σ0 (𝑛) σ0 (𝑛) denotes the divisor count function: the number of divisors of n.
𝐻𝑛 =
σ1 (𝑛) σ1 𝑛 denotes the divisor sum function: the sum of the divisors of n.

𝐿𝑒𝑡 𝑛 be a perfect number

σ1(𝑛)
=2
𝑛
From Divisor Count Function is Odd Iff Argument is Square:
σ0 = 2𝑘
for some 𝑘 ∈ ℤ .
Hence:
2𝑘
𝐻𝑛 = =𝑘
𝑘
Hence the result.
Q.E.D
 RELATIONSHIP

Harmonic Sequence
is a sequence of numbers such that the difference between the reciprocals of any two consecutive
terms is constant.

APPLICATION
1. COMBINATRONICS
2. NUMBER THEORY
3. COMPUTER SCIENCE
 REFERENCES:
1. https://en.wikipedia.org/wiki/Harmonic_series_%28ma
thematics%29
2. https://proofwiki.org/wiki/Perfect_Number_is_Ore_Nu
mber
3. https://planetmath.org/orenumber#:~:text=All%20eve
n%20perfect%20numbers%20are,as%20an%20odd%2
0perfect%20number.
4. https://artofproblemsolving.com/wiki/index.php/Har
monic_sequence
5. https://www.numbersaplenty.com/set/harmonic_nu
mber/
6. https://people.math.harvard.edu/~knill/seminars/perfe
ct/handout.pdf?fbclid=IwZXh0bgNhZW0CMTAAAR30
JHZ28c_VjZm2QguAznc910BNd46ESCPpsgEvxlNbCd
G3xnbnHJNHCNE_aem_AbB4Mhunbb2t2M2_Gj4Pcl
uxLDbTTLhhdvnRyUU6w71xh7v3E5GdC4G3tjXnqJIZ5
8F_nbN8hA-xcsK07qlaRr_O
7. https://www.ma.noda.tus.ac.jp/u/tg/html/harmonic-
e.html
ON POWERFUL NUMBERS
INTRODUCTION
Powerful numbers, also known as squareful numbers or 2-powerful
numbers, are fascinating integers that exhibit a unique property
without the need for complex formulas.

Paul Erdős and George Szekeres studied such numbers and Solomon
W. Golomb named such numbers powerful.
 RATIONALE
A powerful number is a positive integer m such that for
every prime number p dividing m, p2 also divides m.
Equivalently, a powerful number is the product of
a square and a cube, that is, a number m of the form

𝑚 = 𝑎2 𝑏 3 ; 𝑎, 𝑏 ≥ 1
where,
a and b are positive integers.
a and b is a prime factorization of m.
STATEMENT OF THE PROBLEM
This study aims to provide insights into the
underlying structure and distributional
properties of boundaries between consecutive
powerful numbers. Specifically. it sought to
answer the following questions;

1. What is Powerful Numbers?

2. What are the properties and characteristics
of powerful numbers?
3. How powerful number related to:
3.1 Perfect Number
3.2 Prime Factorization
PROPERTIES/ THEOREMS
Thereoms
Theorem 1.1
If three consecutive powerful numbers exist, they must be of the form

36𝑘 + 7,36𝑘 + 8,36𝑘 + 9 , 36𝑘 + 27,36𝑘 + 28,36𝑘 + 29 𝑜𝑟 36𝑘 − 1,36𝑘, 36𝑘 + 1

= (36(𝑘 − 1) + 35, 36𝑘, 36𝑘 + 1) for some integer k.

Theorem 1.2
If k is an odd prime with k ≥5, then Ω𝑘 (𝑛) is not a powerful number.

Theorem 1.3
For any positive integers q and n ≥ max{q, 1198 − q}, the product

(13 + 𝑞 3 )(23 + 𝑞 3 ) ··· (33 + 𝑞 3 )

is not a powerful number.
 RELATIONSHIP

PRIME FACTORIZATION PERFECT NUMBER

which prime numbers multiply is a positive integer that is equal
together to make the original to the sum of its positive
number. proper divisors, that is, divisors
excluding the number itself.

APPLICATION
1. CRYPTOGRAPHY
2. NUMBER THEORY
3. COMBINATRONICS
 REFERENCES:
1. https://en.wikipedia.org/wiki/Powerful_number
2. http://www.drhuang.com/science/mathematics/math
%20word/math/p/p548.htm
3. https://t5k.org/glossary/page.php?sort=PowerfulNum
ber
4. https://mathworld.wolfram.com/PowerfulNumber.ht
ml
5. https://scholar.rose-
hulman.edu/cgi/viewcontent.cgi?article=1424&contex
t=rhumj
6. https://www.sciencedirect.com/science/article/pii/S00
22314X1200176X?ref=pdf_download&fr=RR-
2&rr=88e1488abb0ce666
7. https://www.sciencedirect.com/science/article/pii/S163
1073X17303175?ref=pdf_download&fr=RR-
2&rr=88e148902aa6e666
8. https://www.researchgate.net/publication/26534942_
On_Powerful_Numbers