Home
Search Site
Largest
Finding
How Many?
Mersenne
Glossary
Prime Curios!
e-mail list
FAQ
Prime Lists
Titans
Submit primes
|
This is the Prime Pages'
interface to our BibTeX database. Rather than being an exhaustive database,
it just lists the references we cite on these pages. Please let me know of any errors you notice.References: [ Home | Author index | Key index | Search ] All items with author Forbes (sorted by date)
- Forbes95
- T. Forbes, "Prime k--tuplets -- 9," M500, 146 (September 1995) 6--8.
- Forbes97
- T. Forbes, "A large pair of twin primes," Math. Comp., 66 (1997) 451-455. MR 97c:11111
Abstract:
We describe an efficient integer squaring algorithm (involving the fast Fourier transform modulo F8) that was used on a 486 computer to discover a large pair of twin primes.
[The twin primes 6797727 · 215328± 1 are found on a 486 microcomputer]
- Forbes1999
- T. Forbes, "Prime clusters and Cunningham chains," Math. Comp., 68:228 (1999) 1739--1747. MR 99m:11007
- DF2000
- H. Dubner and T. Forbes, "Prime Pythagorean triangles," (March 2000) Complete text: PDF. (Abstract available)
- DFLMNZ1998
- H. Dubner, T. Forbes, N. Lygeros, M. Mizony, H. Nelson and P. Zimmermann, "Ten consecutive primes in arithmetic progression," Math. Comp., 71:239 (2002) 1323--1328 (electronic). MR 1 898 760 (Abstract available)
- Forbes2002
- T. Forbes, "Fifteen consecutive integers with exactly four prime factors," Math. Comp., (2002) to appear in print.
Abstract:
We describe a successful search for a sequence of fifteen consecutive integers, each the product of exactly four prime factors. Fifteen is best possible.
|
