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 the alpha helix in proteins?

View Question

Which muscle in the human body is responsible for closing the jaw (chewing)?

View Question

Who discovered actin?

View Question

Which Jamaican singer is known as the ‘King of Reggae’?

View Question

Which hormone is primarily responsible for regulating blood glucose by facilitating sugar uptake in cells?

View Question

Who proposed the three laws of motion?

View Question

Which logic gate outputs HIGH only if all inputs are HIGH?

View Question

Which element has the chemical symbol "Ru"?

View Question

What is the hardest natural substance on Earth?

View Question

Which element has the chemical symbol "Ts"?

View Question