Kyauta ne, babu asusu

Kalkuleta na Theorem ragowar Sinanci

Warware tsarin haɗin kai na zamani kuma duba mafi ƙarancin bayani mara kyau tare da haɗin haɗin gwiwa. Moduli masu jituwa waɗanda ba na kwafi ba kuma; an bayyana tsarin rikice-rikice.

Shigar da haɗin kai ɗaya a kowane layi kamar yadda saura, modulus. Misali: 2, 3 yana nufin x ≡ 2 (mod 3). Hakanan zaka iya rubuta x ≡ 2 (mod 3). Shigar da layi 2-20.

Moduli dole ne ya zama lamba ta aƙalla 2; ƙimar da aka shigar na iya zama daga -1,000,000,000,000 zuwa 1,000,000,000,000. Moduli masu jituwa waɗanda ba na kwafi ba ana tallafawa. Wasu tsarin ba su da mafita.

Ta yaya zan yi amfani da ragowar ka'idodin ka'idodin sinawa?

Shigar da saura ɗaya da modules akan kowane layi, ware ta waƙafi, kamar 2, 3 don x ≡ 2 (mod 3). Ƙara layuka 2-20 kuma a lissafta. Sakamakon yana ba da mafi ƙarancin ƙarancin x da haɗin haɗin gwiwa.

Tambayoyin da ake yawan yi

Ta yaya zan yi amfani da ragowar ka'idodin ka'idodin sinawa?

Shigar da saura ɗaya da modules akan kowane layi, ware ta waƙafi, kamar 2, 3 don x ≡ 2 (mod 3). Ƙara layuka 2-20 kuma a lissafta. Sakamakon yana ba da mafi ƙarancin ƙarancin x da haɗin haɗin gwiwa.

Shin an ɗora ma'amalata?

A'a. Lissafin yana gudana a cikin wannan burauzar tare da ainihin ƙididdiga na ƙididdiga. Ba a loda kimar da aka shigar da ku ko adana ta wannan kayan aikin.

Menene ragowar ka'idar Sinawa ta samo?

Yana haɗa congruences zuwa guda mai maimaita ajin bayani. Misali, x ≡ 2 (mod 3) da x ≡ 3 (mod 5) sun haɗu zuwa x ≡ 8 (mod 15).

Moduli na iya raba wani abu?

Ee, lokacin da masu haɗin gwiwa suka yarda modulo babban mai raba su. Misali, x ≡ 2 (mod 4) da x ≡ 6 (mod 8) sun haɗu zuwa x ≡ 6 (mod 8). An ba da rahoton tsarin rikice-rikice da cewa ba su da mafita.

Shin wannan kalkuleta yana amfani da madaidaicin lissafi?

Ee. Yana amfani da lissafin integer na gida na BigInt maimakon lambobi masu iyo, a cikin iyakokin shigarwa da aka nuna a sama.