Proof the following statement: "If a and b have the same remainder when divided by n, i.e. a ≡ b mod n, then the greatest common divisors of a with n and b with n are equal, (a, n) = (b, n). In particular (a, n) = 1 ⇔ (b, n) = 1."
Back
Card 31
Front
Define a permutation
Back
Card 32
Front
How do you calculate the number of possible permutations of a set of n objects?
Back
Card 33
Front
State the theorem of the permutations Sn
Back
Card 34
Front
What is the difference between combinations and permutations?
