mersenne primes
Recently Published Documents


TOTAL DOCUMENTS

55
(FIVE YEARS 2)

H-INDEX

6
(FIVE YEARS 0)

2021 ◽  
Vol 14 (2) ◽  
pp. 396-403
Author(s):  
William Sobredo Gayo, Jr. ◽  
Jerico Bravo Bacani

In this paper, we study and solve the exponential Diophantine equation of the formMxp + (Mq + 1)y = z2 for Mersenne primes Mp and Mq and non-negative integers x, y, and z. We use elementary methods, such as the factoring method and the modular arithmetic method, to prove our research results. Several illustrations are presented, as well as cases where solutions to the Diophantine equation do not exist.


2021 ◽  
pp. 43-76
Author(s):  
Trevor Davis Lipscombe

This chapter provides methods to multiply or divide swiftly by numbers up to 1,001. It includes a discussion of divisibility by seven, as well as conversions between units, such as Celsius to Fahrenheit for temperature; miles per hour to kilometers per second for speed; and bushels, gallons, and firkins to liters. More practical conversions include yards to centimeters, and square inches to square centimeters, illustrated by calculating the area of US book jackets. It also introduces happy numbers and Mersenne primes, and presents a number of worked examples showing the power of rapid multiplications when calculating the atomic weights of various organic molecules.


Author(s):  
Robin Wilson

‘Prime-time mathematics’ explores prime numbers, which lie at the heart of number theory. Some primes cluster together and some are widely spread, while primes go on forever. The Sieve of Eratosthenes (3rd century BC) is an ancient method for identifying primes by iteratively marking the multiples of each prime as not prime. Every integer greater than 1 is either a prime number or can be written as a product of primes. Mersenne primes, named after French friar Marin de Mersenne, are prime numbers that are one less than a power of 2. Pierre de Fermat and Leonhard Euler were also prime number enthusiasts. The five Fermat primes are used in a problem from geometry.


2020 ◽  
Vol 3 (1) ◽  
pp. 15
Author(s):  
Leomarich F Casinillo

<p>Mersenne primes are specific type of prime numbers that can be derived using the formula <img title="\large M_p=2^{p}-1" src="https://latex.codecogs.com/gif.latex?\large&amp;space;M_p=2^{p}-1" alt="" />, where <img title="\large p" src="https://latex.codecogs.com/gif.latex?\large&amp;space;p" alt="" /> is a prime number. A perfect number is a positive integer of the form <img title="\large P(p)=2^{p-1}(2^{p}-1)" src="https://latex.codecogs.com/gif.latex?\large&amp;space;P(p)=2^{p-1}(2^{p}-1)" alt="" /> where <img title="\large 2^{p}-1" src="https://latex.codecogs.com/gif.latex?\large&amp;space;2^{p}-1" alt="" /> is prime and <img title="\large p" src="https://latex.codecogs.com/gif.latex?\large&amp;space;p" alt="" /> is a Mersenne prime, and that can be written as the sum of its proper divisor, that is, a number that is half the sum of all of its positive divisor. In this note, some concepts relating to Mersenne primes and perfect numbers were revisited. Further, Mersenne primes and perfect numbers were evaluated using triangular numbers. This note also discussed how to partition perfect numbers into odd cubes for odd prime <img title="\large p" src="https://latex.codecogs.com/gif.latex?\large&amp;space;p" alt="" />. Also, the formula that partition perfect numbers in terms of its proper divisors were constructed and determine the number of primes in the partition and discuss some concepts. The results of this study is useful to better understand the mathematical structure of Mersenne primes and perfect numbers.</p>


2020 ◽  
pp. 5-58
Author(s):  
Nikolai Vavilov ◽  

Nowhere in mathematics is the progress resulting from the advent of computers is as apparent, as in the additive number theory. In this part, we describe the role of computers in the investigation of the oldest function studied in mathematics, the divisor sum. The disciples of Pythagoras started to systematically explore its behaviour more that 2500 years ago. A description of the trajectories of this function — perfect numbers, amicable numbers, sociable numbers, and the like — constitute the contents of several problems stated over 2500 years ago, which still seem completely inaccessible. A theorem due to Euclid and Euler reduces classification of even perfect numbers to Mersenne primes. After 1914 not a single new Mersenne prime was ever produced manually, since 1952 all of them have been discovered by computers. Using computers, now we construct hundreds or thousands times more new amicable pairs daily, than what was constructed by humans over several millenia. At the end of the paper, we discuss yet another problem posed by Catalan and Dickson


Entropy ◽  
2020 ◽  
Vol 22 (3) ◽  
pp. 311
Author(s):  
Grenville Croll

The order and disorder of binary representations of the natural numbers < 28 is measured using the BiEntropy function. Significant differences are detected between the primes and the non-primes. The BiEntropic prime density is shown to be quadratic with a very small Gaussian distributed error. The work is repeated in binary using a Monte Carlo simulation of a sample of natural numbers < 232 and in trinary for all natural numbers < 39 with similar but cubic results. We found a significant relationship between BiEntropy and TriEntropy such that we can discriminate between the primes and numbers divisible by six. We discuss the theoretical basis of these results and show how they generalise to give a tight bound on the variance of Pi(x)–Li(x) for all x. This bound is much tighter than the bound given by Von Koch in 1901 as an equivalence for proof of the Riemann Hypothesis. Since the primes are Gaussian due to a simple induction on the binary derivative, this implies that the twin primes conjecture is true. We also provide absolutely convergent asymptotes for the numbers of Fermat and Mersenne primes in the appendices.


10.26524/cm25 ◽  
2018 ◽  
pp. 41-47
Author(s):  
Pavana Devassykutty ◽  
Pitchaimani M
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document