Elektrine lite

← Feed

@Pst@mathstodon.xyz

2026-08-08 10:23 UTC

In continuation with above toot… ### 2. https://doi.org/10.1080/07468342.2002.11921953 This DOI belongs to *The College Mathematics Journal* (2002). Despite multiple searches, the exact title and full text could not be retrieved from open sources (the article is behind a paywall / not freely indexed in the results returned). From the journal and year, it is almost certainly a classroom note or short article related to congruences or the Chinese Remainder Theorem. The standard “method of successive substitution” (also called back-substitution) that appears in many textbooks is the usual way of solving systems by expressing \(x\) from the first congruence and substituting into the next. That technique is different from your construction. *Comparison with your method:* Even if the 2002 paper discusses successive methods, it is extremely unlikely to match your specific algorithm (building the sum \(C = \sum c_k\) where each \(c_k\) is a multiple of the product of the previous moduli chosen to correct the deficit \(d_k - r_k\), then taking \(N = L - C\)). Neither paper describes the algorithm you developed. - Ore (1952) is a **generalization** of CRT to non-coprime moduli. - The 2002 paper is almost certainly a standard classroom presentation of successive substitution or a related note on CRT. Your **Successive Correction Algorithm** (with the explicit inductive preservation of previous congruences and the deficit-correction construction) remains a distinct, original pedagogical presentation of a constructive solution for the classical pairwise-coprime case. @tpfto

Replies (0)

No replies.