jeneshicc https://blog.hatena.ne.jp/jeneshicc/ 落書き、時々落学 https://jeneshicc.hatenadiary.org/ 日記 Haskell ちょっと，連立合同方程式を解く必要がでてきたので，実装してみた． ここで，invMod n p = n^(-1) (mod p)． -- Input: 互いに素な整数 m1,m2,...,mn, 整数 a1,a2,...,an -- Output: 連立合同方程式の解 x in Zm s.t. x = ai (mod mi) congruence :: (Integral a) => [a] -> [a] -> a congruence ms as = (`mod` m).sum.zipWith3 add as vs $ us where m = product ms us = [div m … 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20090716%2F1247756328" title="連立合同方程式 - 落書き、時々落学" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> Hatena Blog https://hatena.blog 2009-07-16 23:58:48 rich https://jeneshicc.hatenadiary.org/entry/20090716/1247756328 1.0 100%