Unverified50% confidenceFactExact time
The weighted mod-10 algorithm for the EAN-13 check digit is: counting the first 12 data digits from right to left, odd positions have weight 1 and even positions have weight 3, and after the weighted sum, take the remainder when divided by 10, and subtract the remainder from 10 (if the remainder is 0, the check digit is 0).
1
Sources
50%
Confidence
Long-term
Relevance
10/16/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.70% similarUnverifiedAcross all three concept categories, the median number of same-class samples required for data saturation consistently falls between 7 and 11.68% similarUnverifiedAdding 7 and then taking modulo 7 is equivalent to doing nothing, and can be used to shift negative remainders into the positive range.68% similarVerifiedINT8 quantization maps 32-bit floating-point weights to 8-bit integers, compressing model size by 75% with almost no accuracy loss68% similarUnverifiedavg@12 means letting the model sample 12 times for the same batch of problems and taking the average of the correct rates on each problem, used to reduce the variance caused by sampling randomness.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1044181API
curl https://kongchang.com/api/v1/knowledge/claims/1044181MCP
get_claim(id=1044181)