Difference between revisions 600429830 and 625456821 on enwiki{{Original research|date=September 2014}}⏎ In [[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. There is also an unrelated numerical-analysis method of successive substitution, a [[randomized algorithm]] used for [[root finding]], an application of [[fixed-point iteration]]. (contracted; show full)* [[simultaneous equations]] http://en.wikibooks.org/wiki/Discrete_Mathematics/Modular_arithmetic [[Category:Modular arithmetic]] [[Category:Back Substitution]] [[Category:Modular Arithmetic]] [[Category:Modular Congruences]] 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=625456821.
![]() ![]() 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.
|