Size: 71
Comment:
|
Size: 767
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* 2^n-1 where n is odd * 2^n+1 where n is odd * 2^n+1 where n=4k-2 |
1. * * * * * * * Fibonacci numbers ( |
an±1 fora=2,3,5,6,7,10,11,12 and large exponents n [http://homes.cerias.purdue.edu/~ssw/cun/index.html]an±1 fora≤13 anda not a perfect number [http://wwwmaths.anu.edu.au/~brent/factors.html]2n±1 for1200<n<10000 [http://www.euronet.nl/users/bota/medium-p.htm]10n±1 forn≤100 [http://www.swox.com/gmp/repunit.html]pp±1 wherep is a prime number andp<180 . [http://homes.cerias.purdue.edu/~ssw/bell]22n+1 (Fermat numbers) [http://www.prothsearch.net/fermat.html]Fibonacci numbers (
Fn ) and Lucas numbers (Ln ) forn<10000 [http://home.att.net/~blair.kelly/mathematics/fibonacci/]