🔢 mathematics

A solution to the Straus-Erdős conjecture

The paper claims to provide a solution to the Straus-Erdős conjecture by demonstrating that for every prime number $p$ , there exist positive integers $x \leq y \leq z$ satisfying the equation $\frac{4}{p} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$ .

Original authors: Kyle Bradford

Published 2026-02-13

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Kyle Bradford

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a giant, magical pizza that represents the number 4. Your goal is to cut this pizza into three slices, but there's a very strict rule: every slice must be a "unit fraction." In math-speak, that means the top number of the slice must be a 1 (like 1/2, 1/5, or 1/100).

The Straus-Erdős Conjecture is a famous mathematical puzzle that asks: If you have a prime number (a number only divisible by 1 and itself, like 2, 3, 5, 7, 11...), can you always find a way to cut that magical 4-pizza into three unit-fraction slices, where the denominator of the first slice is that specific prime number?

For example, if your prime is 2, the paper says: "Yes! Here is the cut: 4/2 = 1/1 + 1/2 + 1/2." (One whole pizza, plus two half-pizzas).

This paper, written by Kyle Bradford, claims to have solved the puzzle for every prime number. Here is how the author did it, explained without the heavy math jargon:

1. The Two Main Strategies (The "Types")

The author realizes that prime numbers behave differently depending on what "remainder" they leave when you divide them by 4.

The Easy Case: If the prime is 2, or if it leaves a remainder of 3 when divided by 4, the solution is straightforward. It's like finding a key that fits a lock immediately.
The Hard Case: The tricky primes are those that leave a remainder of 1 when divided by 4 (like 5, 13, 17, 29). For these, the author invents two different "recipes" (which he calls Type I and Type II) to find the solution.

2. The Recipes (Propositions and Lemmas)

Think of these recipes as blueprints for building a bridge.

Recipe A (Type I): The author shows that if a solution exists for a tricky prime, the size of the third slice ( $z$ ) must follow a very specific pattern involving a number $k$ . It's like saying, "If you want to build a bridge to this island, the bridge must be exactly $4k + 3$ miles long."
Recipe B (Type II): Similarly, for the second type of solution, the first slice ( $x$ ) must follow a different pattern.

The author then uses these patterns to create a formula generator. Instead of guessing numbers, he creates a machine that says: "If your prime number fits this specific pattern, then here is exactly how you cut the pizza."

3. The "Covering System" (The Net)

This is the most creative part of the paper. The author knows he can't check every single prime number one by one (there are infinitely many!). So, he builds a safety net.

He creates a list of different "patterns" or "modular rules" (like "primes that leave a remainder of 29 when divided by 44," or "primes that leave a remainder of 5 when divided by 8").

Imagine you are trying to catch every fish in the ocean. You can't catch them one by one.
Instead, you throw out a giant net made of different-sized holes.
The author proves that his net is so well-designed that no matter which prime number you pick, it will fall into at least one of the holes in the net.

Once a prime falls into a hole (a specific pattern), the author's "Recipe Generator" kicks in and instantly produces the three slices (the solution).

4. The Conclusion

The paper concludes by showing that for the first few tricky primes (5, 13, 17, 29), they all fit into the holes of this net. Because the net covers all possible patterns for these numbers, the author claims to have proven that every single prime number has a solution.

In Summary

Kyle Bradford didn't just find one answer; he built a universal key factory.

He identified that some keys are easy to make.
For the hard keys, he designed two specific molds (Type I and Type II).
He proved that every possible prime number fits into at least one of these molds.
Therefore, the puzzle is solved: You can always cut that magical 4-pizza into three perfect unit-fraction slices, no matter which prime number you start with.

Note: While the paper claims a solution, in the world of mathematics, such bold claims are usually subjected to intense scrutiny by other experts to ensure no tiny logical gaps exist in the "net."

Based on the provided text, here is a detailed technical summary of the paper "A SOLUTION TO THE STRAUS ERD˝OS CONJECTURE" by Kyle Bradford.

1. Problem Statement

The paper addresses the Straus-Erdős Conjecture, a problem in number theory concerning the representation of rational numbers as sums of unit fractions. Specifically, the conjecture posits that for every prime number $p$ , there exist positive integers $x, y, z$ such that:
$\frac{4}{p} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$
The author claims to provide an elementary proof establishing the existence of such solutions for all primes.

2. Methodology

The author employs a constructive approach, categorizing potential solutions into two distinct types based on the divisibility of the denominator $y$ by the prime $p$ . The methodology relies on algebraic manipulation of the Diophantine equation and the construction of a covering system of congruences to ensure that every prime $p \equiv 1 \pmod 4$ falls into a solvable category.

Classification of Solutions

The paper distinguishes between two types of solutions:

Type I: Solutions where $p \nmid y$ (p does not divide y).
Type II: Solutions where $p \mid y$ (p divides y).

Analytical Framework

Proposition 1 (Type I): The author derives a structural form for the largest denominator $z$ . If a Type I solution exists for a prime $p \equiv 1 \pmod 4$ , then $z$ must take the form:
$z = \frac{(4k + 3)p^2 + p}{4}$
where $k$ is a non-negative integer. This reduces the problem to expressing a specific fraction as the sum of two unit fractions.
Lemma 1: The author constructs explicit solutions for Type I by defining primes $p$ satisfying specific modular congruences involving parameters $k$ and $\ell$ . The solution is given by:
$\frac{4}{p} = \frac{4(4k + 3) - \ell}{(4k + 3)p + 1} + \frac{\ell}{(4k + 3)p + 1} + \frac{4}{p((4k + 3)p + 1)}$
Proposition 2 & Lemma 2 (Type II): Similarly, for Type II solutions, the author derives a form for the smallest denominator $x$ :
$x = p + \frac{4k + 3}{4}$
Explicit solutions are constructed using a similar modular framework:
$\frac{4}{p} = \frac{4}{p + (4k + 3)} + \frac{4(4k + 3) - \ell}{p(p + (4k + 3))} + \frac{\ell}{p(p + (4k + 3))}$

The Covering System Strategy

The core of the proof involves showing that the set of primes $p \equiv 1 \pmod 4$ is fully covered by the congruence classes derived in Lemmas 1 and 2. By varying $k$ and $\ell$ , the author generates a system of congruences intended to ensure that for any prime $p \equiv 1 \pmod 4$ , at least one set of parameters yields a valid integer solution.

3. Key Contributions and Results

Explicit Construction: The paper provides explicit formulas for $x, y, z$ for specific subsets of primes defined by modular arithmetic (e.g., $p \equiv 29 \pmod{44}$ , $p \equiv 41 \pmod{44}$ , etc.).
Case Analysis:
- $p=2$ : The unique solution is identified as $\frac{4}{2} = \frac{1}{1} + \frac{1}{2} + \frac{1}{2}$ .
- $p \equiv 3 \pmod 4$ : The author notes these are solvable via the greedy algorithm (though the paper focuses primarily on $p \equiv 1 \pmod 4$ ).
- $p \equiv 1 \pmod 4$ : The paper attempts to prove solvability by listing specific modular forms (e.g., $p \equiv 5, 13, 17, 29 \pmod{\dots}$ ) that admit solutions.
Covering Claim: The author asserts that the union of these modular forms constitutes a "covering system," thereby proving that every prime $p \equiv 1 \pmod 4$ admits a solution.

4. Significance and Critical Observation

Claimed Significance:
If valid, this paper would resolve a long-standing open problem in additive number theory, confirming that the equation $\frac{4}{p} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$ is solvable for all primes. This would be a major result in the study of Egyptian fractions.

Critical Observation (Contextual Note):
While the summary above reflects the content of the provided text, there are significant anomalies in the document that suggest it is not a valid mathematical proof in the current state of knowledge:

Future Dates: The header indicates a publication date of February 12, 2026 (arXiv:2602.11774v1), and the journal citation is "INTEGERS: 24 (2024)" despite the 2026 date. This suggests the text is either a fabrication, a fictional exercise, or a "future-dated" hoax.
Mathematical Consistency: The Straus-Erdős conjecture (specifically the case for $k=4$ in the equation $k/p = \sum 1/x_i$ ) is a known difficult problem. While it is widely believed to be true, no elementary proof of this nature has been accepted by the mathematical community as of current knowledge. The "covering system" argument presented here is highly condensed and lacks the rigorous verification usually required to prove that a specific set of congruences covers all primes $p \equiv 1 \pmod 4$ .
Author Affiliation: The author is listed as "Unaffiliated," which is common for independent researchers but requires extra scrutiny for such a high-profile claim.

Conclusion:
The paper presents a structured, albeit likely flawed or hypothetical, attempt to solve the Straus-Erdős conjecture by decomposing the problem into Type I and Type II solutions and using a covering system of congruences. However, given the future dates and the lack of peer-reviewed validation in the real world, this text should be treated as a theoretical exercise or a fictional scenario rather than an established mathematical fact.