Unverified50% confidenceFactExact time
The classical Goldbach conjecture requires decomposing an even number into the sum of two primes, whereas the Liouville weakened version only requires that both addends have an odd total number of prime factors (Liouville function value of -1), allowing composite numbers to qualify.
1
Sources
50%
Confidence
Long-term
Relevance
9/24/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe Liouville–Goldbach conjecture relaxes the requirement of "two primes" to "the total number of prime factors of two numbers is a prime."76% 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.64% 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.64% similarUnverifiedChinese mathematician Chen Jingrun proved the "1+2" form of Goldbach's conjecture (a prime plus the product of two primes).62% similarUnverifiedA Mersenne prime is a prime of the form 2^p − 1, where p itself must also be prime, named after mathematician Marin Mersenne.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/946334API
curl https://kongchang.com/api/v1/knowledge/claims/946334MCP
get_claim(id=946334)