Loading...
Please wait, while we are loading the content...
Similar Documents
Fermat Numbers and Elite Primes
| Content Provider | Semantic Scholar |
|---|---|
| Author | Finch, Steven |
| Copyright Year | 2015 |
| Abstract | Fn+1 = (Fn − 1) + 1, n ≥ 0 and are pairwise coprime. It is conjectured that Fn are always square-free and that, beyond F4, they are never prime. The latter would imply that there are exactly 31 regular polygons with an odd number Gm of sides that can be constructed by straightedge and compass [2]. The values G1, G2, . . ., G31 encompass all divisors of 232−1 except unity [3]. Let G0 = 1. If we scan each row of Pascal’s triangle modulo 2 as a binary integer, then the numbers Gm (listed in ascending order) are naturally extended without bound. The reciprocal sum [4] |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.people.fas.harvard.edu/~sfinch/csolve/fmtp.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
