Chris Cleveland
Followers: 0 Following: 0
Statistik
RANG
N/A
of 300.365
REPUTATION
N/A
BEITRÄGE
0 Fragen
0 Antworten
ANTWORTZUSTIMMUNG
0.00%
ERHALTENE STIMMEN
0
RANG
of 20.933
REPUTATION
N/A
DURCHSCHNITTLICHE BEWERTUNG
0.00
BEITRÄGE
0 Dateien
DOWNLOADS
0
ALL TIME DOWNLOADS
0
BEITRÄGE
0 Beiträge
BEITRÄGE
0 Öffentlich Kanäle
DURCHSCHNITTLICHE BEWERTUNG
BEITRÄGE
0 Highlights
DURCHSCHNITTLICHE ANZAHL DER LIKES
Feeds
Gelöst
Linear primes p' = mp + n
Problem statement List the prime numbers of the form p' = mp + n for a given (m,n) couple and such that p' < k, k positive in...
2 Monate vor
Gelöst
Chek the Delta = p' - p = 6k gap theorem about arithmetic progressions in the prime number set
Context In the prime numbers set there are some arithmetic progressions (sequences of three or more consecutive prime number...
2 Monate vor
Gelöst
List the complementary / symetric prime couples
Problem statement For a given positive integer n, provide the prime couples (p,p') such that p + p' = 10^n. NB : a number li...
2 Monate vor
Gelöst
List primes which are the sum of two consecutive lower primes plus minus one
Problem statement Some prime numbers can be written as the sum of two consecutive lower primes plus / minus one : Like t...
2 Monate vor
Gelöst
List the twin prime couples
Problem statement The twin prime couples (p,p') are the ones such that p' = p + 2. For a given integer n > 1, list the twin p...
2 Monate vor
Gelöst
Check Legendre's conjecture
Context and problem statement Legendre's conjecture states for a given positive integer n, there always exists at least one pri...
2 Monate vor
Gelöst
Check Bertrand-Chebyshev's theorem about prime numbers
Historical context Bertrand's postulate, also later known as Chebyshev's theorem, is a very important theorem in number theory ...
2 Monate vor
Gelöst
Check p = 6n +/- 1, the generic formula for odd prime numbers greater than 3
Problem statement For all odd prime number p greater than 3, there exists a positive integer n, such that p = 6n +/- 1 : ...
2 Monate vor
Gelöst
Check p = 4n +/- 1, the generic formula for odd prime numbers
Problem statement For all odd prime number p, there exists a positive integer n, such that p = 4n +/- 1 : Check this f...
2 Monate vor
Gelöst
List the near-square primes, p = n² + 1 (Landau's 4th problem)
Historical context At the 1912 International Congress of Mathematicians, Edmund Landau listed four basic problems about prime...
2 Monate vor
Gelöst
Construct a prime circle
A <https://mathworld.wolfram.com/PrimeCircle.html prime circle> is a circular arrangement of the numbers 1 to 2n such that pairs...
2 Monate vor
Gelöst
Play PRIMEGAME
Have you ever used the Sieve of Eratosthenes and said, "I wonder whether there’s a less efficient way to find prime numbers."? N...
2 Monate vor
Gelöst
Determine digits of the Copeland-Erdos constant
<https://www.mathworks.com/matlabcentral/cody/problems/1477-champernowne-constant/solutions/new Cody Problem 1477> asks us to de...
2 Monate vor
Gelöst
Identify Wagstaff primes
The numbers 3, 43, and 2731 are examples of <https://mathworld.wolfram.com/WagstaffPrime.html Wagstaff primes>. Write a func...
2 Monate vor
Gelöst
Identify primorial primes
Cody Problems <https://www.mathworks.com/matlabcentral/cody/problems/46054-count-trailing-zeros-in-a-primorial 46054> and <https...
2 Monate vor
Gelöst
Find the last non-zero digit in a primorial
<https://www.mathworks.com/matlabcentral/cody/groups/2001/problems/45251 Cody Problem 45251> asked us to find the last non-zero ...
2 Monate vor
Gelöst
Count trailing zeros in a primorial
<https://www.mathworks.com/matlabcentral/cody/problems/44068-the-number-of-trailing-zero-digit-of-a-factorial Cody Problem 44068...
2 Monate vor
Gelöst
Determine whether a number is a cluster prime
A <https://mathworld.wolfram.com/ClusterPrime.html cluster prime> is an odd prime number _p_ such that all even numbers less tha...
2 Monate vor
Gelöst
Investigate the frequency of last digits of prime numbers
The last digit of a prime number greater than 5 can be 1, 3, 7, or 9. If the primes are distributed randomly, then these digits ...
2 Monate vor
Gelöst
List the emirps
An emirp is a prime number that becomes a different prime when reversed. The numbers 13, 17, and 149 are emirps, but 11, 19, and...
2 Monate vor
Gelöst
Compute the nth Pythagorean prime
Pythagorean primes have the form p = 4n+1, where n is an integer, and they can be written as the sum of squares of two integers....
2 Monate vor
Gelöst
Euclid primes
Historical context Euclid, the greek mathematician proved at his time that the prime numbers set is an infinite. By the way he ...
2 Monate vor











