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 Greek mathematician is known for a theorem on the ratios in right triangles, discovering a² + b² = c²?

View Question

Which element has the chemical symbol "Ge"?

View Question

Who discovered the printing press?

View Question

Who discovered the Wnt signaling pathway?

View Question

Which scientist is credited with inventing the first practical telephone?

View Question

Which pandemic in the mid-14th century killed an estimated one-third of Europe’s population?

View Question

Who is known as the Light of Asia, credited with founding Buddhism?

View Question

Which continent is known for having the most countries?

View Question

Which element has the chemical symbol "Li"?

View Question

In which organelle does aerobic respiration occur, producing ATP in eukaryotic cells?

View Question