--- title: "Open Problems as a Genre" description: "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." canonical: https://lightmysky.com/learn/mathematics/open-problems-as-a-genre-mt_qBWcaUWG9J source: https://lightmysky.com/learn/mathematics/open-problems-as-a-genre-mt_qBWcaUWG9J.md retrieved: 2026-11-12 --- > **Agent view.** This is the Markdown twin of the page, for tools and assistants. > When to use this site, and the call that answers each job: https://lightmysky.com/agent-instructions.md > API description (OpenAPI 3.1): https://lightmysky.com/openapi.json · Authentication: https://lightmysky.com/auth.md > Pricing: https://lightmysky.com/pricing.md · Catalog: https://lightmysky.com/llms.txt · Full catalog: https://lightmysky.com/llms-full.txt > Every machine-readable file on this domain: https://lightmysky.com/.well-known/ai-catalog.json > Ask for Markdown with `Accept: text/markdown`, a `.md` address, or `?mode=agent`. # 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. Subject: Mathematics · Area: Mathematical Thinking · Ages 23 to 24 Page: https://lightmysky.com/learn/mathematics/open-problems-as-a-genre-mt_qBWcaUWG9J ## Ready when they can - 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 ## Lesson: What makes a question open 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. *(drawing: For 20, test primes up to 10. The pairs 3 + 17 and 7 + 13 work. This verifies one input.)* 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. *(drawing: This shows Chen's allowed form, not a Goldbach prime pair: 25 is composite. It does not locate the theorem's threshold.)* 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. *(drawing: Five terms contain four updates. Each move uses the even rule. This verifies the starting value 16.)* 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. **Recap.** 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.* ## Practice 18 questions on this page, each with its working shown. ## Needs first - [Counterexamples and Testing a Conjecture](https://lightmysky.com/learn/mathematics/counterexamples-and-testing-a-conjecture-mt_SjA4jqNkaM) ## Optional connections - [Countable and Uncountable Sets](https://lightmysky.com/learn/mathematics/countable-and-uncountable-sets-mt_VTHPloNBbJ)