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 Indian city is called the "City of Joy"?

View Question

Who discovered the citric acid cycle?

View Question

Which city is famous for Christ the Redeemer statue?

View Question

Who discovered prions?

View Question

Who discovered the CRISPR bacterial immune system?

View Question

Which day is celebrated as International Women’s Day?

View Question

What is the largest internal organ in the human body?

View Question

Who discovered the Lascaux cave paintings?

View Question

Which part of the brain controls involuntary actions like breathing and heart rate?

View Question

Who discovered nerve growth factor?

View Question