File size: 370 Bytes
8c52ce6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 | ---
source: knowledge_base
topic: discrete_math
class_level: class_11
difficulty: advanced
---
Discrete Mathematics:
Permutations: P(n,r)=n!/(n-r)!. Combinations: C(n,r)=n!/(r!*(n-r)!).
GCD(a,b)=GCD(b,a mod b). LCM(a,b)=a*b/GCD(a,b).
Modular: a≡b(mod n) means n divides (a-b).
Fermat's Little: a^(p-1)≡1(mod p) for prime p.
De Morgan: NOT(A AND B)=NOT(A) OR NOT(B). |