Open Problems as a Genre
An open mathematical problem is a precise question whose answer is not currently known. Learn to state its target, check its status, and describe what a partial result proves and what remains.
What a learner can do afterwards
- State an open problem precisely and say what a solution would have to produce
- Describe a known partial result and the gap it leaves
- Explain why a vague question is not yet a problem
1 · Read
You have used counterexamples to test universal claims. An open mathematical problem is a precise question whose answer is not currently known. Your own failed attempt does not establish that status. Check current mathematical sources. A vague question needs a stated domain and target before a solution can settle it.
Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. Its full claim remains open. The primes may be equal. To check an even integer n, try primes p up to n/2 and test whether n - p is prime. Stopping at n/2 avoids counting reversed pairs twice. Finding one pair verifies that input; finding every pair answers a different question.
A prime is an integer greater than 1 with exactly two positive divisors: 1 and itself. Test a small integer by trying prime divisors up to its square root. A composite integer has a factor no larger than that. The only even prime is 2. Two odd primes have an even sum, so an odd sum of two primes must use 2.
A finite verification covers only the tested inputs. Checking every even integer from 4 through 100 leaves larger evens outside the result. A partial result may restrict the domain or weaken the conclusion. A proof of a universal conjecture establishes every case it names. One valid counterexample refutes it. Fermat's Last Theorem has been proved, so it is no longer open.
Chen's theorem proves that every sufficiently large even integer is a prime plus either a prime or a product of two primes. Factors may repeat. 'Sufficiently large' means there is a threshold above which the statement holds. The second term may be composite, and the theorem does not cover every even integer greater than 2. These gaps keep it from proving Goldbach's full claim.
Twin primes differ by 2, such as 11 and 13. Whether there are infinitely many twin-prime pairs remains open. A proved bounded-gap result gives infinitely many prime pairs with gaps at most a fixed finite bound. That result allows other gaps. It does not by itself establish infinitely many gaps of exactly 2.
For Collatz, start with a positive integer n. Halve an even value; replace an odd value with 3n + 1. Each replacement is one update. Stop when 1 first appears. The open conjecture says every positive start eventually reaches 1. It does not require a decrease at every update or a common update count. A completed path verifies one start.
Axioms are the assumptions used in a proof. A claim is independent of specified axioms if those axioms prove neither it nor its negation. An independence result establishes a limit of that framework. It does not establish that every stronger axiom system has the same limit. State the axioms when reporting such a result.
State the question precisely and check its status. Describe what each result proves, which inputs it covers, and what remains unsettled.
Lesson, questions and flashcards written for this dataset.
Readings, practice questions and flashcards written for this dataset.
More to read
Checking a prime-sum witness
A Goldbach witness for an even integer is a pair of primes adding to it. For example, 24 = 5 + 19 verifies one input. Check both terms: an addition identity alone does not show that a pair consists of primes.
For a small integer m greater than 1, try prime divisors up to its square root. If m were composite, a factor pair would contain a factor at or below that square root. Finding a divisor establishes compositeness. Finding none establishes primality.
To find every unordered prime pair for n, try primes p up to n/2 and test n - p. Larger first terms would repeat pairs in reverse order. To verify just one input, one successful pair is enough. These are different search tasks.
Record the input and the pair together. A list of verified inputs describes the reach of a computation. However long that finite list becomes, it does not by itself provide an argument for every even integer greater than 2.
Reading the gap in a partial result
Compare a result with its target in two places: the inputs covered and the conclusion proved. A computation stopping at a finite bound covers fewer inputs than a conjecture about all positive integers.
Chen's theorem concerns sufficiently large even integers. It permits a prime plus either another prime or a product of two primes. The product may use repeated factors. For instance, 7 × 7 has two prime factors counting repetition, although its value is composite.
Goldbach demands two primes for every even integer greater than 2. Chen's result therefore leaves both a domain gap and a conclusion gap. Allowing a composite second term does not disprove Goldbach: an integer can have several representations.
Factorization helps check whether a candidate term is prime. Unique factorization alone does not supply the additive representation Goldbach asks for. Describe the conclusion actually proved before claiming that one theorem settles another question.
A path is not every path
A precise sequence question specifies its starts, its update rule and its target. Collatz starts with a positive integer. Halve an even value; replace an odd value n with 3n + 1. The target is the first appearance of 1.
Starting from 7 gives 22 and then 11. The first move increases the value. This does not refute the conjecture, which asks about eventual arrival at 1 rather than decrease at every move.
Count updates as moves between terms. A displayed path with five terms has four moves. Once a path reaches 1, it verifies its starting value. A full proof would need to handle every positive start, not just the displayed paths.
A failed search can help suggest another approach, but failure to find an answer does not establish that no answer exists. Likewise, someone encountering Collatz for the first time should check its mathematical status rather than infer that status from their own attempts.
2 · Watch
Take it off screen
Where it sits
Learn first
Optional connections
This opens up
Nothing builds on it yet.
Where this leads
Jobs that lean on this skill. Follow one to see everything it is built on.
18 questions wait behind this lesson, each with its answer explained. Every answer feeds the sky: stars light as they are learned, and dim when it is time to come back.