Unverified50% confidenceFactExact time
Euler 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.
1
Sources
50%
Confidence
Long-term
Relevance
8/31/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedA Mersenne prime is a prime of the form 2^p − 1, where p itself must also be prime, named after mathematician Marin Mersenne.77% similarUnverified戴德金通过分割构造实数，康托尔通过柯西序列的等价类来定义实数64% similarUnverifiedThe Riemann Hypothesis states that the real parts of all non-trivial zeros of the Riemann zeta function are equal to 1/2, all lying on the critical line.63% similarUnverifiedCohen's Kappa系数的计算公式为 κ = (Po - Pe) / (1 - Pe)，用于排除偶然因素导致的一致63% similarUnverifiedIn 1984, Spencer, Szemerédi, and Trotter proved the upper bound result U(N) ≤ O(N^(4/3)), meaning the number of unit-distance pairs among N points does not exceed a constant multiple of N to the power of 4/3.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/830005API
curl https://kongchang.com/api/v1/knowledge/claims/830005MCP
get_claim(id=830005)