Some recent results of number theory discovered with electronic computers
DOI10.1080/0020739820130513zbMath0509.10002OpenAlexW2155119053MaRDI QIDQ4748200
Publication date: 1982
Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020739820130513
Fermat's last theoremFibonacci numbersperfect numberszeros of Riemann zeta-functionFermat quotientprimeamicable numberstwin primesociable numbersWilson quotient
(zeta (s)) and (L(s, chi)) (11M06) Software, source code, etc. for problems pertaining to number theory (11-04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Elementary number theory (11Axx)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- On the roots of the Riemann zeta-function
- On Bernoulli's numbers and Fermat's last theorem
- An elementary proof of the prime-number theorem
- Lower bounds for amicable numbers not divisible by each other
- Extended computation of the Riemann zeta‐function
- The factorization of 𝐹₇
- On Square Fibonacci Numbers
- Consecutive Primes in Arithmetic Progression
- Untersuchungen über ungerade vollkommene Zahlen.
- On a New Method in Elementary Number Theory Which Leads to An Elementary Proof of the Prime Number Theorem
- AN APPLICATION OF HIGH-SPEED COMPUTING TO FERMAT'S LAST THEOREM
This page was built for publication: Some recent results of number theory discovered with electronic computers