John Selfridge

Source: Wikipedia, the free encyclopedia.
John Selfridge
Born(1927-02-17)February 17, 1927
University of Illinois at Urbana-Champaign
Northern Illinois University
Doctoral advisorTheodore Motzkin

John Lewis Selfridge (February 17, 1927 – October 31, 2010[1]), was an American mathematician who contributed to the fields of analytic number theory, computational number theory, and combinatorics.

Education

Selfridge received his Ph.D. in 1958 from the University of California, Los Angeles under the supervision of Theodore Motzkin.[2]

Career

Selfridge served on the faculties of the

University of Illinois at Urbana-Champaign and Northern Illinois University
(NIU) from 1971 to 1991 (retirement), chairing the NIU Department of Mathematical Sciences 1972–1976 and 1986–1990. He was executive editor of
Selfridge prize
in his honour.

Research

In 1962, he proved that 78,557 is a

Sierpinski number; he showed that, when k = 78,557, all numbers of the form k2n + 1 have a factor in the covering set {3, 5, 7, 13, 19, 37, 73}. Five years later, he and Sierpiński proposed the conjecture that 78,557 is the smallest Sierpinski number, and thus the answer to the Sierpinski problem. A distributed computing project called Seventeen or Bust is currently trying to prove this statement, as of April 2017
only five of the original seventeen possibilities remain.

In 1964, Selfridge and Alexander Hurwitz proved that the 14th Fermat number was composite. [5] However, their proof did not provide a factor. It was not until 2010 that the first factor of the 14th Fermat number was found. [6] [7]

In 1975

Derrick Henry Lehmer
, and Selfridge developed a method of proving the primality of p given only partial factorizations of p − 1 and p + 1. [8] Together with
Cunningham project
.

Together with Paul Erdős, Selfridge solved a 150-year-old problem, proving that the product of consecutive numbers is never a power.[9] It took them many years to find the proof, and John made extensive use of computers, but the final version of the proof requires only a modest amount of computation, namely evaluating an easily computed function f(n) for 30,000 consecutive values of n. Selfridge suffered from writer's block and thanked "R. B. Eggleton for reorganizing and writing the paper in its final form".[9]

Selfridge also developed the

Selfridge–Conway discrete procedure for creating an envy-free cake-cutting among three people. Selfridge developed this in 1960, and John Conway independently discovered it in 1993. Neither of them ever published the result, but Richard Guy told many people Selfridge's solution in the 1960s, and it was eventually attributed to the two of them in a number of books and articles.[citation needed
]

Selfridge's conjecture about Fermat numbers

Selfridge made the following conjecture about the

Fermat numbers Fn = 22n + 1 . Let g(n) be the number of distinct prime factors of Fn (sequence A046052 in the OEIS). As to 2016, g(n) is known only up to n = 11, and it is monotonic. Selfridge conjectured that contrary to appearances, g(n) is NOT monotonic. In support of his conjecture he showed: a sufficient (but not necessary) condition for its truth is the existence of another Fermat prime beyond the five known (3, 5, 17, 257, 65537).[10]

Selfridge's conjecture about primality testing

This conjecture is also called the PSW conjecture, after Selfridge,

Samuel Wagstaff
.

Let p be an odd number, with p ≡ ± 2 (mod 5). Selfridge conjectured that if

  • 2p−1 ≡ 1 (mod p) and at the same time
  • fp+1 ≡ 0 (mod p),

where fk is the kth

Samuel Wagstaff offers $100 for an example or a proof, and Carl Pomerance offers $20 for an example and $500 for a proof. Selfridge requires that a factorization be supplied, but Pomerance does not. The related test that fp−1 ≡ 0 (mod p) for p ≡ ±1 (mod 5) is false and has e.g. a 6-digit counterexample.[11][12]
The smallest counterexample for +1 (mod 5) is 6601 = 7 × 23 × 41 and the smallest for −1 (mod 5) is 30889 = 17 × 23 × 79. It should be known that a heuristic by Pomerance may show this conjecture is false (and therefore, a counterexample should exist).

See also

References

  1. ^ a b "John Selfridge (1927–2010)". DeKalb Daily Chronicle. November 11, 2010. Retrieved November 13, 2010.
  2. ^ John Selfridge at the Mathematics Genealogy Project
  3. ^ "Chinese Acrobatics, an Old-Time Brewery, and the "Much Needed Gap": The Life of Mathematical Reviews" (PDF). ams.org. 1997-03-01. Retrieved 2023-05-04.
  4. ^ "Math Times, Fall 2007". Archived from the original on 2011-06-05.
  5. JSTOR 2003419
    .
  6. ^ Rajala, Tapio (3 February 2010). "GIMPS' second Fermat factor!". Retrieved 9 April 2017.
  7. ^ Keller, Wilfrid. "Fermat factoring status". Retrieved 11 April 2017.
  8. JSTOR 2005583
    .
  9. ^
    ISSN 0019-2082
    .
  10. ^ Prime Numbers: A Computational Perspective, Richard Crandall and Carl Pomerance, Second edition, Springer, 2011 Look up Selfridge's Conjecture in the Index.
  11. ^ According to an email from Pomerance.
  12. ^ Carl Pomerance, Richard Crandall, Prime Numbers: A Computational Perspective, Second Edition, p. 168, Springer Verlag, 2005.

Publications

  • Pirani, F. A. E.; Moser, Leo; Selfridge, John (1950). "Elementary Problems and Solutions: Solutions: E903". Am. Math. Mon. 57 (8): 561–562.
    MR 1527674
    .
Retrieved from "https://en.wikipedia.org/w/index.php?title=John_Selfridge&oldid=1177355668"