Congruence theorem inverse element Chinese remainder theorem Fermat small theorem

Congruence theorem Congruence theorem is an important concept in number theory. Given a positive integer m, if two integers a and B satisfy (a-b) and can be divided by m, that is, (a-b) / M obtains an integer, then the integers a and B are called modulo m congruence and recorded as a ≡ b(mod m). If the remainder of two integers a and b ...

Posted on Sun, 28 Nov 2021 04:33:15 -0500 by Monk3h

Decimal point (Euler's theorem)

Link Meaning: Idea: f ( i ) f(i) f(i) the conclusion is that if i i If i contains only 2 and 5, then it is 0, ot ...

Posted on Fri, 01 Oct 2021 16:02:56 -0400 by explore

Game Theory Template

1. Bash Game There is only a stack of n items from which two people take turns. It is stipulated to take at least one item at a time and at most m items at a time. The winner is the last one who takes light. If n%(m+1)==0 the later hand will win, otherwise the first hand will win, if n>m, take n%(m+1) for the first time, if n<=m, any one ...

Posted on Fri, 10 Sep 2021 12:09:42 -0400 by mac007