Table of Contents
Fetching ...

Elemental Patterns from the Erdős Straus Conjecture

Kyle Bradford

Abstract

This paper makes the following conjecture: For every prime $p$ there exists a positive integer $x$ with $\left\lceil \frac{p}{4} \right\rceil \leq x \leq \left\lceil \frac{p}{2} \right\rceil$ and a positive divisor $d|x^2$ so that either: (1) $ d \bmod \left( 4x - p \right) \equiv -px$; or (2) $d \leq x$ and $ d \bmod \left( 4x - p \right) \equiv -x$. Furthermore this paper proves that the solutions to these modular equations are in one-to-one correspondence with the solutions of the diophantine equation used in the Erdős Straus conjecture.

Elemental Patterns from the Erdős Straus Conjecture

Abstract

This paper makes the following conjecture: For every prime there exists a positive integer with and a positive divisor so that either: (1) ; or (2) and . Furthermore this paper proves that the solutions to these modular equations are in one-to-one correspondence with the solutions of the diophantine equation used in the Erdős Straus conjecture.
Paper Structure (4 sections, 6 theorems, 31 equations, 1 figure, 2 tables)

This paper contains 4 sections, 6 theorems, 31 equations, 1 figure, 2 tables.

Key Result

Proposition 1

Suppose for a prime $p$ there exists a positive integer $x$ with $\left\lceil \frac{p}{4} \right\rceil \leq x \leq \left\lceil \frac{p}{2} \right\rceil$ and a positive divisor $d | x^2$ so that $d \bmod \left( 4x - p \right) \equiv -px$. Then letting we see that $x,y$ and $z$ are positive integers with $x \leq y \leq z$ and $p \nmid y$.

Figures (1)

  • Figure 1: This graphs primes less than 100 against the possible solution values x in the Erdős Straus conjecture

Theorems & Definitions (13)

  • Proposition 1
  • Corollary 1
  • Proposition 2
  • Corollary 2
  • Proposition 3
  • Proposition 4
  • Conjecture 1
  • proof
  • proof
  • proof
  • ...and 3 more