Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors

DOI10.1134/s1064562423700783OpenAlexW4388625971MaRDI QIDQ6148160

Nikolai A. Vavilov

Publication date: 11 January 2024

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562423700783

zbMATH Keywords

perfect numbersMersenne primesamicable numberssociable numbersdivisor sumsaliquot sequencesCatalan-Dickson conjectureGuy-Selfridge conjectureCatalan-Mersenne conjecture

Mathematics Subject Classification ID

History of number theory (11-03) Arithmetic functions; related numbers; inversion formulas (11A25) Number theory (educational aspects) (97F60)

Cites Work

• A Proof of the Lucas-Lehmer Test
• A new lower bound for odd perfect numbers
• 63.34 The most recently discovered prime number
• Issues in Nonlinear Hyperperfect Numbers
• The 25th and 26th Mersenne Primes
• Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors
• On the distribution of amicable numbers. II.
• 65.1 Even perfect numbers
• Hyperperfect Numbers With Three Different Prime Factors
• Some Large Primes and Amicable Numbers
• On Odd Perfect, Quasiperfect, and Odd Almost Perfect Numbers
• On the second largest prime divisor of an odd perfect number
• A Search for Aliquot Cycles Below 10 10
• Improved Techniques for Lower Bounds for Odd Perfect Numbers
• A Note on Almost Perfect Numbers
• What Drives an Aliquot Sequence?
• On the Largest Prime Divisor of an Odd Perfect Number. II
• New Primality Criteria and Factorizations of 2 m ± 1
• On the Number of Prime Factors of a Pair of Relatively Prime Amicable Numbers
• On Asymptotic Properties of Aliquot Sequences
• On the distribution of amicable numbers.
• Quasi-Amicable Numbers
• A Search for Large Twin Prime Pairs
• Advances in aliquot sequences
• The second largest prime divisor of an odd perfect number exceeds ten thousand
• A Search for Aliquot Cycles and Amicable Pairs
• A line element algorithm for curve flow problems in the plane
• Odd perfect numbers
• On 𝜙-amicable pairs
• Every odd perfect number has a prime factor which exceeds 10⁶
• New amicable four-cycles
• On the total number of prime factors of an odd perfect number
• A Theorem of Touchard on the Form of Odd Perfect Numbers
• The Little Book of Bigger Primes
• My Numbers, My Friends
• The reciprocal sum of the amicable numbers
• More on the total number of prime factors of an odd perfect number
• The aliquot constant, after Bosma and Kane
• A Really Trivial Proof of the Lucas-Lehmer Test
• Iterating the Sum-of-Divisors Function
• Odd Perfect Numbers Not Divisible by 3. II
• Sketch of a Proof that an Odd Perfect Number Relatively Prime to 3 has at Least Eleven Prime Factors
• Divisors of Mersenne Numbers
• Some new factorizations of 2ⁿ±1
• Note on a Mersenne number
• Eine Schranke für befreundete Zahlen mit gegebener Teileranzahl
• The first known type (7,1) amicable pair
• Odd perfect numbers have a prime factor exceeding $10^{7}$
• Multiamicable Numbers
• On Odd Perfect Numbers and Even 3-Perfect Numbers
• Prime-Perfect Numbers
• Finiteness Theorems for Perfect Numbers and Their Kin
• NOTE ON ODD MULTIPERFECT NUMBERS
• The third largest prime divisor of an odd perfect number exceeds one hundred
• What’s Special about the Perfect Number 6?
• On the divisibility of odd perfect numbers, quasiperfect numbers and amicable numbers by a high power of a prime
• Four Large Amicable Pairs
• A Search Procedure and Lower Bound for Odd Perfect Numbers
• A Lower Bound for the Set of Odd Perfect Numbers
• On the Largest Prime Divisor of an Odd Perfect Number
• Upper bounds on the second largest prime factor of an odd perfect number
• The range of the sum-of-proper-divisors function
• Odd perfect numbers, Diophantine equations, and upper bounds
• A remarkable quartic yielding certain divisors of Mersenne numbers
• AN UPPER BOUND FOR THE NUMBER OF ODD MULTIPERFECT NUMBERS
• ADDITION TO ‘AN UPPER BOUND FOR THE NUMBER OF ODD MULTIPERFECT NUMBERS’
• Paul Erdős and the Rise of Statistical Thinking in Elementary Number Theory
• IMPROVED UPPER BOUNDS FOR ODD MULTIPERFECT NUMBERS
• Aliquot Sequence 3630 Ends After Reaching 100 Digits
• Unitary Perfect Numbers
• Some Factorizations of 2 n ± 1 and Related Results
• On the Distribution of Mersenne Divisors
• Amicable Numbers With Opposite Parity
• Amicable Numbers and the Bilinear Diophantine Equation
• The Number of Prime Divisors of Certain Mersenne Numbers
• Systematic Computations on Amicable Numbers
• More Amicable Numbers
• On Divisibility by Nine of the Sums of Even Amicable Pairs
• On Relatively Prime Odd Amicable Numbers
• Bemerkungen zu einer Arbeit von H.-J. Kanold.
• On Amicable and Sociable Numbers
• Amicable Numbers and Their Distribution
• Lower Bounds for Relatively Prime Amicable Numbers of Opposite Parity
• Bi-Unitary Perfect Numbers
• The 24th Mersenne Prime
• Relatively Prime Amicable Numbers with Twenty-One Prime Divisors
• Quasiperfect numbers
• Unitary Amicable Numbers
• A New Result Concerning the Structure of Odd Perfect Numbers
• On Thabit ibn Kurrah's Formula for Amicable Numbers
• Odd perfect numbers are divisible by at least seven distinct primes
• Almost Perfect Numbers
• Bemerkung zu einem Ergebnis von Erdös über befreundete Zahlen.
• К проблемам теории дружественных чисел
• Some Miscellaneous Factorizations
• On the Factors of Certain Mersenne Numbers, II
• Three New Mersenne Primes and a Statistical Theory
• Fermat Numbers and Mersenne Numbers
• Amicable Pairs of the Form (i, 1)
• On Lucas's Test for the Primality of Mersenne's Numbers
• Untersuchungen über ungerade vollkommene Zahlen.
• On All of Mersenne's Numbers Particularly M ₁₉₃
• On the factors of 2ⁿ±1
• On Mersenne’s number 𝑀₁₉₉ and Lucas’s sequences
• On Mersenne’s number 𝑀₂₂₇ and cognate data
• On the Least Possible Odd Perfect Number
• Über befreundete Zahlen. I
• Some New Multiply Perfect Numbers
• Über befreundete Zahlen. II
• Mersenne and Fermat Numbers
• First Proof that the Mersenne Number M ₁₅₇ Is Composite
• Note on the Mersenne numbers 𝑀₁57 and 𝑀₁67
• Lucas's Tests for Mersenne Numbers
• Proof that the Mersenne number 𝑀₁₆₇ is composite
• On the non-existence of odd perfect numbers of form 𝑝^{𝛼}𝑞₁²𝑞₂²⋯𝑞_{𝑡-1}²𝑞_{𝑡}⁴
• Note on the non-existence of odd perfect numbers of form 𝑝^{𝛼}𝑞₁²𝑞₂²⋯𝑞_{𝑡-1}²𝑞_{𝑡}⁴
• The reciprocal sum of divisors of Mersenne numbers
• Numerical and Statistical Analysis of Aliquot Sequences
• The world of primes. Secrets and records. Transl. from the English by Jörg Richstein. Updated by Wilfrid Keller
• Mersenne Numbers
• Mersenne Numbers
• Some Factorizations of Numbers of the Form 2 n ± 1
• On near-perfect numbers
• Unsolved problems in number theory
• Odd perfect numbers: some new issues
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• Computers as a novel mathematical reality. I: A personal account
• A congruence relation of the Catalan-Mersenne numbers
• On relatively prime amicable pairs
• On perfect and near-perfect numbers
• On the greatest common divisor of a number and its sum of divisors
• On amicable tuples
• Amicable numbers with given number of prime divisors
• On perfect and multiply perfect numbers
• Über die Häufigkeit vollkommener Zahlen
• Bemerkung zu der Arbeit über vollkommene Zahlen in Math. Ann. Bd. 133, S. 431-438 (1957)
• Faktorenzerlegung Mersennescher Zahlen mittels programmgesteuerter Rechengeräte
• On the number of distinct prime factors of an odd perfect number
• A remark on sociable numbers of odd order
• On the distribution of sociable numbers
• Thābit ibn Qurra and the pair of amicable numbers 17296, 18416
• Some new results on odd perfect numbers
• Multiply perfect numbers, Mersenne primes, and effective computability
• Eine Bemerkung zu den vollkommenen Zahlen
• Notes on Thābit ibn Qurra and his rule for amicable numbers
• On the number of prime factors of values of the sum-of-proper-divisors function
• Gaussian amicable pairs
• On the square-freeness of Fermat and Mersenne numbers
• Super perfect numbers
• On the sum \(\sum_{d\mid 2^n-1} d^{-1}\)
• Verschärfung der notwendigen Bedingungen für die Existenz von ungeraden vollkommenen Zahlen
• Non-existence of odd perfect numbers of the form \(3^{2\beta}p_1^{2\beta_1}s_2^{2\beta_2}s_3^{2\beta_3}\)
• Über ungerade vollkommene Zahlen
• Ein Satz über natürliche Zahlen \(N\) mit \(\sigma(N)=3N\)
• Breeding amicable numbers in abundance. II
• Some problems of Erdős on the sum-of-divisors function
• Amicable pairs with few distinct prime factors
• ODD MULTIPERFECT NUMBERS
• Aliquot Cycles of Repdigits
• THE ALIQUOT CONSTANT
• Sieve methods for odd perfect numbers
• Odd perfect numbers are greater than $10^{1500}$
• ON PRIME FACTORS OF ODD PERFECT NUMBERS
• Harmonious pairs
• Amicable pairs and aliquot cycles on average
• Analytic Number Theory
• On the numbers of prime factors of square free amicable pairs
• Powerful amicable numbers
• On Dickson's Theorem Concerning Odd Perfect Numbers
• BOUNDS FOR ODD k-PERFECT NUMBERS
• Odd harmonic numbers exceed 10²⁴
• DIVISOR‐SUM FIBERS
• On the number of prime factors of an odd perfect number
• New Sociable Numbers
• A New Mersenne Prime
• On the problem of odd h-fold perfect numbers
• Über mehrfach vollkommene Zahlen. II.
• Sur certaines hypothèses concernant les nombres premiers
• The Numerical Evaluation of the Eighteenth Perfect Number
• New Factors of Mersenne Numbers
• On the Factors of Certain Mersenne Numbers
• Divisors of Mersenne Numbers 10,000 < p < 15,000
• All Factors q < 10 8 in All Mersenne Numbers 2 p - 1, p Prime < 10 4
• New Mersenne Primes
• Search Limits on Divisors of Mersenne numbers
• On Generating New Amicable Pairs from Given Amicable Pairs
• On prime divisors of Mersenne numbers
• Handbook of Number Theory I
• On the largest prime divisor of an odd harmonic number
• The Editor's Corner: The New Mersenne Conjecture
• The Second Strong Law of Small Numbers
• Odd perfect numbers have a prime factor exceeding $10^8$
• Odd perfect numbers have at least nine distinct prime factors
• Breeding Amicable Numbers in Abundance
• Computation of all the amicable pairs below 10¹⁰
• On primitive divisors of Mersenne numbers
• Are There Odd Amicable Numbers Not Divisible by Three
• The Strong Law of Small Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item