Unverified50% confidenceFactExact time
The Liouville–Goldbach conjecture relaxes the requirement of "two primes" to "the total number of prime factors of two numbers is a prime."
1
Sources
50%
Confidence
Long-term
Relevance
9/24/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedEuler proved that every even perfect number can be written in the form 2^(p−1) × (2^p − 1), where 2^p − 1 is a Mersenne prime.68% similarUnverifiedIn a letter written to Euler in 1742, Goldbach proposed the conjecture that every even number greater than 2 can be expressed as the sum of two prime numbers.66% similarUnverifiedFermat's Last Theorem states that when the integer n is greater than 2, the equation x^n + y^n = z^n has no positive integer solutions.66% similarUnverifiedChinese mathematician Chen Jingrun proved the "1+2" form of Goldbach's conjecture (a prime plus the product of two primes).66% similarUnverifiedA Mersenne prime is a prime of the form 2^p − 1, where p itself must also be prime, named after mathematician Marin Mersenne.66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/946311API
curl https://kongchang.com/api/v1/knowledge/claims/946311MCP
get_claim(id=946311)