Unverified50% confidenceFactExact time
The repunit Rₙ = (10ⁿ - 1)/9 itself contains no factor of 2 or 5, because 10ⁿ - 1 always ends in 9, meaning it is odd and not divisible by 5.
1
Sources
50%
Confidence
Long-term
Relevance
9/27/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe smallest n for which 10ⁿ ≡ 1 (mod N) holds is called the multiplicative order of 10 modulo N, and it determines the number of digits in the final answer.74% similarUnverifiedThe repunit sequence R₁=1, R₂=11, R₃=111... produces remainders modulo an integer N that fall within only N possible values from 0 to N-1; examining the first N+1 terms guarantees two remainders are equal, and their difference is divisible by N.73% similarUnverifiedAdam的一阶矩衰减系数β₁通常默认为0.960% similarUnverifiedThe five identity-preserving transformations include decimal notation, fractions, percentages, English number words, scientific notation, and equivalent unit conversions.58% similarUnverifiedThe --sref weight value has a maximum of 10; in this case it is set to 7, and the higher the value, the closer the generated result is to the reference style.58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/953415API
curl https://kongchang.com/api/v1/knowledge/claims/953415MCP
get_claim(id=953415)