Perfect Numbers and Fibonacci Sequences

10.1142/12477 ◽  
2022 ◽  
Author(s):  
Tianxin Cai
Keyword(s):  
Perfect Numbers ◽  
Fibonacci Sequences

Polynomial values in Fibonacci sequences

2020 ◽  
Vol 13 (4) ◽  
pp. 597-605
Author(s):  
Adi Ostrov ◽  
Danny Neftin ◽  
Avi Berman ◽  
Reyad A. Elrazik
Keyword(s):  
Fibonacci Sequences

Perfect Numbers

1910 ◽  
Vol 17 (8-9) ◽  
pp. 165-168
Author(s):  
T. M. Putnam
Keyword(s):  
Perfect Numbers

65.1 Even Perfect Numbers

1981 ◽  
Vol 65 (431) ◽  
pp. 28 ◽  
Author(s):  
Graeme L. Cohen
Keyword(s):  
Perfect Numbers

A lower bound for \tau(n) of any k-perfect numbers

2015 ◽  
Vol 4 ◽  
pp. 99-103
Author(s):  
Keneth Adrian P. Dagal
Keyword(s):  
Lower Bound ◽  
Perfect Numbers

Nature-Inspired Quasicrystal SRG Using Fibonacci Sequences in Photo-Reconfiguration on Azo Polymer Films

2018 ◽  
Vol 26 (11) ◽  
pp. 1042-1047 ◽  
Author(s):  
Kang-Han Kim ◽  
Kuk Young Cho ◽  
Yong-Cheol Jeong
Keyword(s):  
Polymer Films ◽  
Azo Polymer ◽  
Fibonacci Sequences

Pseudoperfect numbers with no small prime divisors

2009 ◽  
Vol 93 (528) ◽  
pp. 404-409
Author(s):  
Peter Shiu
Keyword(s):  
Difficult Problem ◽  
Prime Divisors ◽  
Perfect Number ◽  
Perfect Numbers ◽  
Mersenne Primes ◽  
Mersenne Prime

A perfect number is a number which is the sum of all its divisors except itself, the smallest such number being 6. By results due to Euclid and Euler, all the even perfect numbers are of the form 2P-1(2p - 1) where p and 2p - 1 are primes; the latter one is called a Mersenne prime. Whether there are infinitely many Mersenne primes is a notoriously difficult problem, as is the problem of whether there is an odd perfect number.

Sign in / Sign up

Export Citation Format

Share Document