Processing Math: Done
jsMath
Differences between revisions 1 and 16 (spanning 15 versions)
Revision 1 as of 2007-01-23 01:39:03
Size: 71
Comment:
Revision 16 as of 2007-01-23 03:24:38
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. an±1 for a=2,3,5,6,7,10,11,12 and large exponents n [http://homes.cerias.purdue.edu/~ssw/cun/index.html]
 * an±1 for a13 and a not a perfect number [http://wwwmaths.anu.edu.au/~brent/factors.html]
 * 2n±1 for 1200<n<10000 [http://www.euronet.nl/users/bota/medium-p.htm]
 * 10n±1 for n100 [http://www.swox.com/gmp/repunit.html]
 * pp±1 where p is a prime number and p<180. [http://homes.cerias.purdue.edu/~ssw/bell]
 * 22n+1 (Fermat numbers) [http://www.prothsearch.net/fermat.html]
 * 23n±1 [http://www.alpertron.com.ar/MODFERM.HTM]
 * Fibonacci numbers (Fn) and Lucas numbers (Ln) for n<10000 [http://home.att.net/~blair.kelly/mathematics/fibonacci/]
  1. an±1 for a=2,3,5,6,7,10,11,12 and large exponents n [http://homes.cerias.purdue.edu/~ssw/cun/index.html]

  2. an±1 for a≤13 and a not a perfect number [http://wwwmaths.anu.edu.au/~brent/factors.html]

  3. 2n±1 for 1200<n<10000 [http://www.euronet.nl/users/bota/medium-p.htm]

  4. 10n±1 for n≤100 [http://www.swox.com/gmp/repunit.html]

  5. pp±1 where p is a prime number and p<180. [http://homes.cerias.purdue.edu/~ssw/bell]

  6. 22n+1 (Fermat numbers) [http://www.prothsearch.net/fermat.html]

  7. 23n±1 [http://www.alpertron.com.ar/MODFERM.HTM]

  8. Fibonacci numbers (Fn) and Lucas numbers (Ln) for n<10000 [http://home.att.net/~blair.kelly/mathematics/fibonacci/]

factorization_of_integers_of_special_forms (last edited 2008-11-14 13:41:51 by anonymous)