Topic Details (Notes format)

Fermat’s Little Theorem

Subject: Static GK (General Knowledge)

Book: Famous Theorems & Laws

If p is prime and a is not divisible by p, then a^(p−1) ≡ 1 (mod p). Used in number theory and cryptography (e.g., RSA).

Practice Questions

Which event is regarded as the start of the French Revolution?

View Question

What currency is used in the United Kingdom?

View Question

Which key invention is Johannes Gutenberg known for?

View Question

Which part of the tooth is visible above the gum line, covered by enamel?

View Question

Who discovered somatic cell nuclear transfer?

View Question

Who discovered the human genome sequencing?

View Question

Which element has the chemical symbol "Dy"?

View Question

Which is the largest desert in the world?

View Question

Who composed the National Song of India, "Vande Mataram"?

View Question

Which element has the chemical symbol "Br"?

View Question