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

Who discovered RNA interference?

View Question

Who discovered the mechanism of synaptic vesicle fusion?

View Question

Which element has the chemical symbol "Mt"?

View Question

Which city is the capital of Peru, known for its Plaza Mayor and colonial architecture?

View Question

Which bone is commonly known as the collarbone?

View Question

Which element has the chemical symbol "O"?

View Question

Who is often called the Father of Computer Science?

View Question

Who discovered gravitational waves?

View Question

In which year was the Indian National Congress founded?

View Question

In which European city can you ride a gondola along the Grand Canal?

View Question