ON CENTERED CUBE NUMBER

STATEMENT OF THE PROBLEM

The main objective of the study is to present and
determine the Centered Cube Number. Specifically,
this study aims to answer the following questions:

1. What is Centered Cube Number?

2.What are the properties/theorem of Centered

Cube Number?

3. How is the Centered Cube Number related to:

3.1
3.2
4. What are the application of Centered Cube
Number?
INTRODUCTION
Centered cubic numbers are a fascinating subset of figurate numbers
that represent a three-dimensional extension of centered figurate
numbers. These numbers are structured in such a way that they
visually and conceptually form a centered cube, with one central
element and layers of cubes surrounding this center.

The concept of centered cubic numbers can be understood by

visualizing a cube with layers. At the core of this structure is a single
cube (the first centered cubic number, which is 1). Surrounding this
central cube, subsequent layers form additional cubes in a
symmetrical manner, expanding outward while maintaining a cubic
formation.
 RATIONALE
A centered cube number is a centered figurate number that
counts the points in a three-dimensional pattern formed by a
point surrounded by concentric cubical layers of points, with
ί2 points on the square faces of the ίth layer. Equivalently, it is
the number of points in a body-centered cubic pattern within
a cube that has n + 1 points along each of its edges.

OEIS INDEX : A005898

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).

Theorem 1.
Wagstaff prime numbers are infinite.
 RELATIONSHIP

MERSENNE PRIME FERMAT PRIME

it is a prime number of the form
A number of the form
for some integer p. ;
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_const
ruction_of_Wagstaff_primes
7. https://
www.researchgate.net/publication/359176247_Solving_the_const
ruction_of_Wagstaff_primes\
8. https://
www.casioeducation.com.au/wp-content/uploads/2020/06/A-Prim
e-Experience_CP.pdf
9. http://www.prothsearch.com/fermat.html
10. https://www.physicsforums.com/threads/primality-criteria-for-wag
staff-numbers.586253
/
ON EVANGELIST SEQUENCE
 STATEMENT OF THE PROBLEM
This study aims to provide insights into the
underlying structure and distributional
properties of Evangelist Sequence . Specifically.
it sought to answer the following questions;

1. What is Evangelist Sequence ?

2. What are the properties of Evangelist
Sequence ?
3. How Evangelist Sequence related to:
3.1
3.2
3.3
4. What are the application of Evangelist
Sequence ?
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.
 PROPERTIES/ THEOREMS
Thereoms
Theorem 1.1
Perfect Number is an Ore Harmonic Number
be a perfect number
then , is an Ore Harmonic Number
𝑃𝑅𝑂𝑂𝐹 :
𝑛 σ 0 (𝑛) denotes the divisor count function: the number of divisors of n.
𝐻𝑛=
σ 1( 𝑛) denotes the divisor sum function: the sum of the divisors of n.

be a perfect number

From Divisor Count Function is Odd Iff Argument is Square:

for some 𝑘 ∈ .
Hence:

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_%
28mathematics%29
2. https://proofwiki.org/wiki/Perfect_Number_is_Ore_Number
3. https://planetmath.org/orenumber#:~:text=All%20even%20perfect
%20numbers%20are,as%20an%20odd%20perfect%20number
.
4. https://
artofproblemsolving.com/wiki/index.php/Harmonic_sequence
5. https://www.numbersaplenty.com/set/harmonic_number/
6. https://people.math.harvard.edu/~
knill/seminars/perfect/handout.pdf?fbclid=IwZXh0bgNhZW0CM
TAAAR30JHZ28c_VjZm2QguAznc910BNd46ESCPpsgEvxlNb
CdG3xnbnHJNHCNE_aem_AbB4Mhunbb2t2M2_Gj4PcluxLDb
TTLhhdvnRyUU6w71xh7v3E5GdC4G3tjXnqJIZ58F_nbN8hA-x
csK07qlaRr_O
7. https://www.ma.noda.tus.ac.jp/u/tg/html/harmonic-e.html
ON STIRLING NUMBER OF THE SECOND
KIND
 STATEMENT OF THE PROBLEM
This study aims to provide insights into the
Stirling Number of the Second Kind.
Specifically. it sought to answer the following
questions;

1. What is Stirling Number of the Second Kind?

2. What are the properties and characteristics
of Stirling Number of the Second Kind?
3. How Stirling Number of the Second Kind
related to:
3.1 Bell Number; and
3.2 Fubini Number;
4. What are the application of Stirling Number
of the Second Kind?
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

where,
a and b are positive integers.
a and b is a prime factorization of m.
PROPERTIES/ THEOREMS
Thereoms
Theorem 1.1
If three consecutive powerful numbers exist, they must be of the form

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

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/p5
48.htm
3. https://t5k.org/glossary/page.php?sort=PowerfulNumber
4. https://mathworld.wolfram.com/PowerfulNumber.html
5. https://
scholar.rose-hulman.edu/cgi/viewcontent.cgi?article=1424&conte
xt=rhumj
6. https://
www.sciencedirect.com/science/article/pii/S0022314X1200176X?
ref=pdf_download&fr=RR-2&rr=88e1488abb0ce666
7. https://
www.sciencedirect.com/science/article/pii/S1631073X17303175?
ref=pdf_download&fr=RR-2&rr=88e148902aa6e666
8. https://
www.researchgate.net/publication/26534942_On_Powerful_Num
bers