Method of successive substitution formula to obtain the solution. Method of successive substitution 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. The method of successive substitution is also known as back substitution. Consider the simple set of simultaneous congruences Now, for "x" ≡ 3 (mod 4) to be
International Chemistry Olympiad seems appropriate, the selection process usually involves holding regional and national olympiad competitions. Many countries hold "training camps" for its top students, where mentors from the country give the students accelerated college-level courses in chemistry with an emphasis on the topics covered in that year's preparatory problems as well as practical training. It is agreed that such training programs must not exceed a total duration of two weeks but there are allegations every year that some countries exceed this limit by months or even years. Another concern is that some countries tend to bring the same students to the competition