Neighbors with Prescribed Prime Factors

CSEF · 2012 Mathematics & Software Second Award

Overview

Objectives/Goals To formulate a new method that is more efficient than that of Lehmer and still creates a relatively thorough solution set. Methods/Materials An initial set is augmented with new solutions found by a simple procedure. We then repeat this procedure to further augment the set until no new solutions arise. The process ends when no more solutions are found through combination of any two numbers in the set. Results We performed our process with a maximal prime factor of 163 where as Lehmer's method only reached a prime factor of 41. We found 115,207 solutions to our equation. The largest solution we found was 19,316,158,377,073,923,834,000, though it may be possible to find a larger solution if we used a higher maximal prime. Conclusions/Discussion Our new method creates solutions to Lehmer's equation that he was unable to find through his exhaustive methods. Work on the ABC Conjecture relates back to many other conjectures and theorems, such as Fermat's Last Theorem, Roth's Theorem, and the Mordell Conjecture. These findings are specific to set of numbers that fit the limitations of the ABC Conjecture and Lehmer's equation.

Summary statement

In our project, we developed a more efficient method to solve an equation in comparison to a possible solution proposed by D. H. Lehmer in 1964.

Help received

Dr. Conrey of the American Institute of Mathematics helped us in the technical side of our project and allowed us to use his house as a research base.

Awards (1)

Competition history

  • CSEF 2012 Mathematics & Software · Entry S1410

Resources

Related projects

Closest projects by meaning, across every fair and year in the corpus.

Browse more like this

Source: California Science & Engineering Fair public projects

Save projects to your library

Sign in with Google to keep track of projects you find interesting, organized into folders. An account also raises your daily allowance for “Has this been done?”, and lets you create a key for the MCP server with a much higher limit than anonymous use. Browsing stays public.

Continue with Google