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 is the main repository of genetic information inside a eukaryotic cell?

View Question

Which element has the chemical symbol "Tm"?

View Question

Which element has the chemical symbol "Sc"?

View Question

Which city is famous for Christ the Redeemer statue?

View Question

Which element has the chemical symbol "Re"?

View Question

In which year was the United Nations officially formed?

View Question

Who discovered aquaporins?

View Question

Who discovered the ancient ruins of Susa?

View Question

Which Spanish conquistador conquered the Aztec Empire in the early 16th century?

View Question

Which city is the capital of the Canadian province of Ontario?

View Question