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 key invention is Johannes Gutenberg known for?

View Question

The UNO (United Nations Organization) was founded in which year?

View Question

The Nobel Prize for Literature was first awarded in which year?

View Question

Which element has the chemical symbol "Ca"?

View Question

Which element has the chemical symbol "Sg"?

View Question

Who discovered astatine?

View Question

Which tectonic plate underlies most of the Pacific Ocean?

View Question

In which African country can you visit the Pyramids of Giza?

View Question

Which empire built the famous Machu Picchu site?

View Question

Which element has the chemical symbol "Sr"?

View Question