Difference between revisions 76560602 and 76560704 on enwikiIn [[modular arithmetic]], the '''method of successive substitution''' is a method of solving problems of [[simultaneous congruences]] by using the definition of the congruence equation. It is commonly applied in cases where the conditions of the [[Chinese remainder theorem]] are not satisfied. (contracted; show full)If the moduli are [[coprime]], the [[Chinese remainder theorem]] gives a straightforward formula to obtain the solution. == See also == * [[simultaneous equations]] [[Category:Modular arithmetic]] [[fr:Méthode des substitutions successives]] ⏎ Squirrel is the king of kings WOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO WOOOOOOOOOOOOOOOOOOOoooo WOOO WOO All content in the above text box is licensed under the Creative Commons Attribution-ShareAlike license Version 4 and was originally sourced from https://en.wikipedia.org/w/index.php?diff=prev&oldid=76560704.
![]() ![]() This site is not affiliated with or endorsed in any way by the Wikimedia Foundation or any of its affiliates. In fact, we fucking despise them.
|