factorization_of_integers_of_special_forms - Sagemath Wiki

Processing Math: Done

No jsMath TeX fonts found -- using unicode fonts instead.
This may be slow and might not print well.
Use the jsMath control panel to get additional information.

jsMath Control PanelHide this Message

jsMath

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 a≤13 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 n≤100 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/
n*2n±1 (Cullen and Woodall numbers) http://www.leyland.vispa.com/numth/factorization/cullen_woodall/cw.htm
Euclid numbers http://en.wikipedia.org/wiki/Sylvester's_sequence#Divisibility_and_factorizations

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