Other

Four-Colors Theorem

In 1852 a South African mathematician, Francis Guthrie, was coloring a map of the counties of England a…

Linear Congruence

Def :  Let a , b belong integer numbers , and n belongs to natural  numbers .  Then  ax = b (mod n)  Is calle…

Fermat's Little Theorem

Def : Let p be prime number , a belongs to integers , and  p doesn't divide a . Then a^p-1 = 1 (mod p)

Euler's Theorem

Def : If n belongs natural numbers , a belongs integers such that  GCD(a , n) = 1 . Then a^Q(n) = 1 (mod n )…

The Euclidean Algorithm

Let  a ,b belongs integers except {0} If  a = q*b + r , then GCD(a,b)=GCD(b,r) . q: is called the quotient  …

Division Algorithms

\begin{array}{l} Let\;\;\;\;a,b \in Z\;\;\;\;,\;\;\;\;b \in N\\ Then\;there\;exist\;unique\;\;\;\;\;q,r \…

Diophantine Equation

Definition: Diophantine equation is any equation in one or more unknowns with integer coefficient and to be s…

The Pigeonhole Principle

If k is a positive integer and k+1 or more objects are placed into k boxes , then there is at least one box …

The principle of Inclusion Exclusion

Inclusion Exclusion Rule  A 1 ∪ A 2 ∪ . . . ∪ A n ≡ ∑ 1 ≤ i ≤ n A i   - ∑ i ≠ j A i ∩ A j   + ∑ d i f …

Load More
That is All