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 Roman general became dictator for life before being assassinated in 44 BC?

View Question

Which country hosted the first modern Olympic Games in 1896?

View Question

Which planet is known as the "Morning Star"?

View Question

Which element has the chemical symbol "Y"?

View Question

Who discovered gamma-ray bursts?

View Question

Who discovered prions?

View Question

Who discovered the discovery of insulin?

View Question

Which British city is known for The Beatles and Liverpool F.C.?

View Question

Which scientist’s name is associated with the laws of planetary motion?

View Question

Which planet is the hottest in our solar system?

View Question