Chinese remainder theorem
id:
chinese-remainder-theorem-186-16632363
title:
Chinese remainder theorem
text:
In mathematics, the Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime. For example, if we know that the remainder of n divided by 3 is 2, the remainder of n divided by 5 is 3, and the remainder of n divided by 7 is 2, then without knowing the value of n, we can
brand slug:
wiki
category slug:
encyclopedia
description:
Theorem for solving simultaneous congruences
original url:
https://en.wikipedia.org/wiki/Chinese_remainder_theorem
date created:
2002-01-11T20:57:05Z
date modified:
2024-09-08T05:28:59Z
main entity:
{"identifier":"Q193878","url":"https://www.wikidata.org/entity/Q193878"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/9/9d/Sun_Tzu_Chinese_remainder_theorem.svg","width":512,"height":768}
fields total:
13
integrity:
16