In number theory , a cubic prime of the 1st kind (from the English cuban prime ) is a prime number that has the following form:
p
=
x
3
-
y
3
x
-
y
{\ displaystyle p = {\ frac {x ^ {3} -y ^ {3}} {xy}}}
with integer and .
x
=
y
+
1
{\ displaystyle x = y + 1}
y
>
0
{\ displaystyle y> 0}
These kinds of cubic primes were first explored in 1912 by Allan Joseph Champneys Cunningham in the article On quasi-Mersennian numbers .
A cubic prime of the 2nd kind has the following form:
p
=
x
3
-
y
3
x
-
y
{\ displaystyle p = {\ frac {x ^ {3} -y ^ {3}} {xy}}}
with integer and .
x
=
y
+
2
{\ displaystyle x = y + 2}
y
>
0
{\ displaystyle y> 0}
This type of cubic prime was also first explored by AJC Cunningham in 1923 in the article Binomial Factorizations .
The English name cuban prime comes from cube number , not from Cuba .
properties
Every cubic prime of the first kind can be converted into the following forms:
p
=
(
y
+
1
)
3
-
y
3
{\ displaystyle p = (y + 1) ^ {3} -y ^ {3}}
p
=
3
y
2
+
3
y
+
1
{\ displaystyle p = 3y ^ {2} + 3y + 1}
p
=
3
x
2
-
3
x
+
1
{\ displaystyle p = 3x ^ {2} -3x + 1}
Proof of the 1st form:
A cubic prime of the first kind has the form with . Thus:
p
=
x
3
-
y
3
x
-
y
{\ displaystyle p = {\ frac {x ^ {3} -y ^ {3}} {xy}}}
x
=
y
+
1
{\ displaystyle x = y + 1}
p
=
x
3
-
y
3
x
-
y
=
(
y
+
1
)
3
-
y
3
(
y
+
1
)
-
y
=
(
y
+
1
)
3
-
y
3
1
=
(
y
+
1
)
3
-
y
3
{\ displaystyle p = {\ frac {x ^ {3} -y ^ {3}} {xy}} = {\ frac {(y + 1) ^ {3} -y ^ {3}} {(y + 1) -y}} = {\ frac {(y + 1) ^ {3} -y ^ {3}} {1}} = (y + 1) ^ {3} -y ^ {3}}
.
◻
{\ displaystyle \ Box}
Proof of the 2nd form:
A cubic prime of the 1st kind, as shown above, has the form . Thus:
p
=
(
y
+
1
)
3
-
y
3
{\ displaystyle p = (y + 1) ^ {3} -y ^ {3}}
p
=
(
y
+
1
)
3
-
y
3
=
y
3
+
3
y
2
+
3
y
+
1
-
y
3
=
3
y
2
+
3
y
+
1
{\ displaystyle p = (y + 1) ^ {3} -y ^ {3} = y ^ {3} + 3y ^ {2} + 3y + 1-y ^ {3} = 3y ^ {2} + 3y +1}
.
◻
{\ displaystyle \ Box}
Proof of the 3rd form:
As shown above, a cubic prime of the 1st kind has the form with (i.e. with ). Thus:
p
=
3
y
2
+
3
y
+
1
{\ displaystyle p = 3y ^ {2} + 3y + 1}
x
=
y
+
1
{\ displaystyle x = y + 1}
y
=
x
-
1
{\ displaystyle y = x-1}
p
=
3
y
2
+
3
y
+
1
=
3
(
x
-
1
)
2
+
3
(
x
-
1
)
+
1
=
3
x
2
-
6th
x
+
3
+
3
x
-
3
+
1
=
3
x
2
-
3
x
+
1
{\ displaystyle p = 3y ^ {2} + 3y + 1 = 3 (x-1) ^ {2} +3 (x-1) + 1 = 3x ^ {2} -6x + 3 + 3x-3 + 1 = 3x ^ {2} -3x + 1}
.
◻
{\ displaystyle \ Box}
Proof:
A cubic prime of the 1st kind, as shown above, has the form . Centered hexagon numbers have the shape .
p
=
3
x
2
-
3
x
+
1
{\ displaystyle p = 3x ^ {2} -3x + 1}
3
n
2
-
3
n
+
1
{\ displaystyle 3n ^ {2} -3n + 1}
◻
{\ displaystyle \ Box}
Every cubic prime of the 2nd kind can be converted into the following forms:
p
=
(
y
+
2
)
3
-
y
3
2
{\ displaystyle p = {\ frac {(y + 2) ^ {3} -y ^ {3}} {2}}}
p
=
3
y
2
+
6th
y
+
4th
{\ displaystyle p = 3y ^ {2} + 6y + 4}
p
=
3
x
2
-
6th
x
+
4th
{\ displaystyle p = 3x ^ {2} -6x + 4}
p
=
3
n
2
+
1
{\ displaystyle p = 3n ^ {2} +1}
with ,
n
=
y
+
1
{\ displaystyle n = y + 1}
n
>
1
{\ displaystyle n> 1}
Proof of the 1st form:
A cubic prime of the 2nd kind has the form with . Thus:
p
=
x
3
-
y
3
x
-
y
{\ displaystyle p = {\ frac {x ^ {3} -y ^ {3}} {xy}}}
x
=
y
+
2
{\ displaystyle x = y + 2}
p
=
x
3
-
y
3
x
-
y
=
(
y
+
2
)
3
-
y
3
(
y
+
2
)
-
y
=
(
y
+
2
)
3
-
y
3
2
{\ displaystyle p = {\ frac {x ^ {3} -y ^ {3}} {xy}} = {\ frac {(y + 2) ^ {3} -y ^ {3}} {(y + 2) -y}} = {\ frac {(y + 2) ^ {3} -y ^ {3}} {2}}}
.
◻
{\ displaystyle \ Box}
Proof of the 2nd form:
A cubic prime of the 2nd kind, as shown above, has the form . Thus:
p
=
(
y
+
2
)
3
-
y
3
2
{\ displaystyle p = {\ frac {(y + 2) ^ {3} -y ^ {3}} {2}}}
p
=
(
y
+
2
)
3
-
y
3
2
=
y
3
+
6th
y
2
+
12
y
+
8th
-
y
3
2
=
6th
y
2
+
12
y
+
8th
2
=
3
y
2
+
6th
y
+
4th
{\ displaystyle p = {\ frac {(y + 2) ^ {3} -y ^ {3}} {2}} = {\ frac {y ^ {3} + 6y ^ {2} + 12y + 8- y ^ {3}} {2}} = {\ frac {6y ^ {2} + 12y + 8} {2}} = 3y ^ {2} + 6y + 4}
.
◻
{\ displaystyle \ Box}
Proof of the 3rd form:
A cubic prime of the 2nd kind has, as shown above, the form with (i.e. with ). Thus:
p
=
3
y
2
+
6th
y
+
4th
{\ displaystyle p = 3y ^ {2} + 6y + 4}
x
=
y
+
2
{\ displaystyle x = y + 2}
y
=
x
-
2
{\ displaystyle y = x-2}
p
=
3
y
2
+
6th
y
+
4th
=
3
(
x
-
2
)
2
+
6th
(
x
-
2
)
+
4th
=
3
x
2
-
12
x
+
12
+
6th
x
-
12
+
4th
=
3
x
2
-
6th
x
+
4th
{\ displaystyle p = 3y ^ {2} + 6y + 4 = 3 (x-2) ^ {2} +6 (x-2) + 4 = 3x ^ {2} -12x + 12 + 6x-12 + 4 = 3x ^ {2} -6x + 4}
.
◻
{\ displaystyle \ Box}
Proof of the 4th form:
A cubic prime of the 2nd kind, as shown above, has the form . If one substitutes , one obtains:
p
=
3
y
2
+
6th
y
+
4th
{\ displaystyle p = 3y ^ {2} + 6y + 4}
y
: =
n
-
1
{\ displaystyle y: = n-1}
p
=
3
y
2
+
6th
y
+
4th
=
3
(
n
-
1
)
2
+
6th
(
n
-
1
)
+
4th
=
3
n
2
-
6th
n
+
3
+
6th
n
-
6th
+
4th
=
3
n
2
+
1
{\ displaystyle p = 3y ^ {2} + 6y + 4 = 3 (n-1) ^ {2} +6 (n-1) + 4 = 3n ^ {2} -6n + 3 + 6n-6 + 4 = 3n ^ {2} +1}
.
◻
{\ displaystyle \ Box}
Examples
The prime number can be represented as and is therefore a cubic prime number of the first kind.
p
=
61
{\ displaystyle p = 61}
p
=
5
3
-
4th
3
5
-
4th
=
125
-
64
1
=
61
{\ displaystyle p = {\ frac {5 ^ {3} -4 ^ {3}} {5-4}} = {\ frac {125-64} {1}} = 61}
The smallest cubic prime numbers of the first kind are:
7, 19, 37, 61, 127, 271, 331, 397, 547, 631, 919, 1657, 1801, 1951, 2269, 2437, 2791, 3169, 3571, 4219, 4447, 5167, 5419, 6211, 7057, 7351, 8269, 9241, 10267, 11719, 12097, 13267, 13669, 16651, 19441, 19927, 22447, 23497, 24571, 25117, 26227, ... (sequence A002407 in OEIS )
If one represents the cubic prime numbers of the 1st kind in the form , the first ones are the following:
p
=
3
x
2
-
3
x
+
1
{\ displaystyle p = 3x ^ {2} -3x + 1}
x
{\ displaystyle x}
2, 3, 4, 5, 7, 10, 11, 12, 14, 15, 18, 24, 25, 26, 28, 29, 31, 33, 35, 38, 39, 42, 43, 46, 49, 50, 53, 56, 59, 63, 64, 67, 68, 75, 81, 82, 87, 89, 91, 92, 94, 96, 106, 109, 120, 124, 126, 129, 130, 137, 141, 143, 148, 154, 157, 158, 159, 165, 166, 171, 172, ... (sequence A002504 in OEIS )
Example:
If you take the number at the 30th position from this list , you get , and actually the 30th cubic prime number is of the 1st kind, as you can see from the previous list.
63
{\ displaystyle 63}
p
=
3
⋅
63
2
-
3
⋅
63
+
1
=
11719
{\ displaystyle p = 3 \ cdot 63 ^ {2} -3 \ cdot 63 + 1 = 11719}
p
=
11719
{\ displaystyle p = 11719}
The number of cubic prime numbers of the 1st kind, which are smaller than , can be read from the following list for :
10
n
{\ displaystyle 10 ^ {n}}
n
=
0
,
1
,
2
,
...
{\ displaystyle n = 0,1,2, \ ldots}
0, 1, 4, 11, 28, 64, 173, 438, 1200, 3325, 9289, 26494, 76483, 221530, 645685, 1895983, 5593440, 16578830, 49347768, 147402214, 441641536, 1326941536, 3996900895, 12066234206, 36501753353 ... (Follow A113478 in OEIS )
Example:
In the list above you can find the number in the 5th position . This means that cubic primes of the 1st kind are smaller than .
28
{\ displaystyle 28}
28
{\ displaystyle 28}
10
4th
=
10,000
{\ displaystyle 10 ^ {4} = 10000}
The currently largest known cubic prime of the 1st kind is the following:
p
=
(
100000845
4096
+
1
)
3
-
(
100000845
4096
)
3
100000845
4096
+
1
-
100000845
4096
=
(
100000845
4096
+
1
)
3
-
(
100000845
4096
)
3
=
3
⋅
100000845
8192
+
3
⋅
100000845
4096
+
1
{\ displaystyle p = {\ frac {(100000845 ^ {4096} +1) ^ {3} - (100000845 ^ {4096}) ^ {3}} {100000845 ^ {4096} + 1-100000845 ^ {4096}} } = (100000845 ^ {4096} +1) ^ {3} - (100000845 ^ {4096}) ^ {3} = 3 \ cdot 100000845 ^ {8192} +3 \ cdot 100000845 ^ {4096} +1}
She has jobs and was discovered by Jens Kruse Andersen on January 7, 2006.
65537
{\ displaystyle 65537}
The smallest cubic prime numbers of the 2nd kind are:
13, 109, 193, 433, 769, 1201, 1453, 2029, 3469, 3889, 4801, 10093, 12289, 13873, 18253, 20173, 21169, 22189, 28813, 37633, 43201, 47629, 60493, 63949, 65713, 69313, 73009, 76801, 84673, 106033, 108301, 112909, 115249, 129793, 139969, ... (sequence A002648 in OEIS )
generalization
A generalized cubic prime has the following form:
p
=
x
3
-
y
3
x
-
y
{\ displaystyle p = {\ frac {x ^ {3} -y ^ {3}} {xy}}}
with integer
x
>
y
>
0
{\ displaystyle x> y> 0}
properties
Any generalized cubic prime can be converted into the following forms:
p
=
x
2
+
x
y
+
y
2
{\ displaystyle p = x ^ {2} + xy + y ^ {2}}
with integer
x
>
y
>
0
{\ displaystyle x> y> 0}
p
=
6th
k
+
1
{\ displaystyle p = 6k + 1}
with and
k
∈
N
{\ displaystyle k \ in \ mathbb {N}}
k
>
0
{\ displaystyle k> 0}
In other words:
p
≡
1
(
mod
6th
)
{\ displaystyle p \ equiv 1 {\ pmod {6}}}
Proof of the 1st form:
Because of the formula (see here ):
a
3
-
b
3
=
(
a
-
b
)
⋅
(
a
2
+
a
b
+
b
2
)
{\ displaystyle a ^ {3} -b ^ {3} = (ab) \ cdot (a ^ {2} + ab + b ^ {2})}
One can transform into .
p
{\ displaystyle p}
p
=
x
3
-
y
3
x
-
y
=
x
2
+
x
y
+
y
2
{\ displaystyle p = {\ frac {x ^ {3} -y ^ {3}} {xy}} = x ^ {2} + xy + y ^ {2}}
◻
{\ displaystyle \ Box}
Proof of the 2nd form:
Be with and . Then is . If you calculate all variants for and through, you get the four remaining classes . Thus, the representations can assume or . The representations and are always composed and the representation is also composed except for . So only the representation remains.
p
=
x
2
+
x
y
+
y
2
≡
z
(
mod
6th
)
{\ displaystyle p = x ^ {2} + xy + y ^ {2} \ equiv z {\ pmod {6}}}
x
≡
m
(
mod
6th
)
{\ displaystyle x \ equiv m {\ pmod {6}}}
y
≡
n
(
mod
6th
)
{\ displaystyle y \ equiv n {\ pmod {6}}}
p
≡
m
2
+
m
n
+
n
2
≡
z
(
mod
6th
)
{\ displaystyle p \ equiv m ^ {2} + mn + n ^ {2} \ equiv z {\ pmod {6}}}
m
=
0
,
1
,
...
5
{\ displaystyle m = 0.1, \ ldots 5}
n
=
0
,
1
,
...
5
{\ displaystyle n = 0.1, \ ldots 5}
p
≡
z
≡
0
,
1
,
3
,
4th
(
mod
6th
)
{\ displaystyle p \ equiv z \ equiv 0,1,3,4 {\ pmod {6}}}
p
{\ displaystyle p}
6th
k
,
6th
k
+
1
,
6th
k
+
3
{\ displaystyle 6k, 6k + 1.6k + 3}
6th
k
+
4th
{\ displaystyle 6k + 4}
6th
k
{\ displaystyle 6k}
6th
k
+
4th
{\ displaystyle 6k + 4}
6th
k
+
3
{\ displaystyle 6k + 3}
p
=
3
{\ displaystyle p = 3}
p
=
6th
k
+
1
{\ displaystyle p = 6k + 1}
◻
{\ displaystyle \ Box}
Examples
The smallest generalized cubic prime numbers of the form are:
p
=
x
2
+
x
y
+
y
2
{\ displaystyle p = x ^ {2} + xy + y ^ {2}}
3, 7, 13, 19, 31, 37, 43, 61, 67, 73, 79, 97, 103, 109, 127, 139, 151, 157, 163, 181, 193, 199, 211, 223, 229, 241, 271, 277, 283, 307, 313, 331, 337, 349, 367, 373, 379, 397, 409, 421, 433, 439, 457, 463, 487, 499, 523, 541, 547, 571, 577, 601, 607, 613, ... (sequence A007645 in OEIS )
Strictly speaking, the prime number does not belong to the above definition of generalized cubic prime numbers, because one can only obtain with and thus the original requirement is not fulfilled. For all other numbers with would be and therefore not a prime number.
p
=
3
{\ displaystyle p = 3}
p
=
3
{\ displaystyle p = 3}
x
=
y
=
1
{\ displaystyle x = y = 1}
x
>
y
{\ displaystyle x> y}
0
<
x
=
y
≠
1
{\ displaystyle 0 <x = y \ not = 1}
p
=
x
2
+
x
y
+
y
2
=
3
x
2
{\ displaystyle p = x ^ {2} + xy + y ^ {2} = 3x ^ {2}}
Individual evidence
↑ a b Cuban prime . In: PlanetMath . (English)
^ Allan JC Cunningham: On quasi-Mersennian numbers. Messenger of Mathematics 41 , 1912, p. 144 , accessed July 7, 2018 .
↑ 3 • 100000845 8192 + 3 • 100000845 4096 + 1 on Prime Pages
↑ Umesh P. Nair: Elementary results on the binary quadratic form a ^ 2 + ab + b ^ 2, Theorem 10. p. 4 , accessed July 7, 2018 .
Web links
swell
AJC Cunningham: On Quasi-Mersennian Numbers . In: Messenger of Mathematics . tape 41 . England 1912, p. 119-146 .
AJC Cunningham: Binomial Factorizations . London 1923.
formula based
Carol ((2 n - 1) 2 - 2) |
Cullen ( n ⋅2 n + 1) |
Double Mersenne (2 2 p - 1 - 1) |
Euclid ( p n # + 1) |
Factorial ( n! ± 1) |
Fermat (2 2 n + 1) |
Cubic ( x 3 - y 3 ) / ( x - y ) |
Kynea ((2 n + 1) 2 - 2) |
Leyland ( x y + y x ) |
Mersenne (2 p - 1) |
Mills ( A 3 n ) |
Pierpont (2 u ⋅3 v + 1) |
Primorial ( p n # ± 1) |
Proth ( k ⋅2 n + 1) |
Pythagorean (4 n + 1) |
Quartic ( x 4 + y 4 ) |
Thabit (3⋅2 n - 1) |
Wagstaff ((2 p + 1) / 3) |
Williams (( b-1 ) ⋅ b n - 1)
Woodall ( n ⋅2 n - 1)
Prime number follow
Bell |
Fibonacci |
Lucas |
Motzkin |
Pell |
Perrin
property-based
Elitist |
Fortunate |
Good |
Happy |
Higgs |
High quotient |
Isolated |
Pillai |
Ramanujan |
Regular |
Strong |
Star |
Wall – Sun – Sun |
Wieferich |
Wilson
base dependent
Belphegor |
Champernowne |
Dihedral |
Unique |
Happy |
Keith |
Long |
Minimal |
Mirp |
Permutable |
Primeval |
Palindrome |
Repunit ((10 n - 1) / 9) |
Weak |
Smarandache – Wellin |
Strictly non-palindromic |
Strobogrammatic |
Tetradic |
Trunkable |
circular
based on tuples
Balanced ( p - n , p , p + n) |
Chen |
Cousin ( p , p + 4) |
Cunningham ( p , 2 p ± 1, ...) |
Triplet ( p , p + 2 or p + 4, p + 6) |
Constellation |
Sexy ( p , p + 6) |
Safe ( p , ( p - 1) / 2) |
Sophie Germain ( p , 2 p + 1) |
Quadruplets ( p , p + 2, p + 6, p + 8) |
Twin ( p , p + 2) |
Twin bi-chain ( n ± 1, 2 n ± 1, ...)
according to size
Titanic (1,000+ digits) |
Gigantic (10,000+ digits) |
Mega (1,000,000+ digits) |
Beva (1,000,000,000+ positions)
Composed
Carmichael |
Euler's pseudo |
Almost |
Fermatsche pseudo |
Pseudo |
Semi |
Strong pseudo |
Super Euler's pseudo
<img src="https://de.wikipedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" title="" width="1" height="1" style="border: none; position: absolute;">