Question
a.
aᵖ⁻¹ ≡ 1 (mod p)
b.
aᵖ⁻¹ ≡ 7 (mod p)
c.
aᵖ⁽²⁾⁻¹ ≡ 1 (mod p)
d.
none of the mentioned
Posted under Discrete Mathematics
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The Fermat’s little theorem for odd prime p and coprime number a is?
Similar Questions
Discover Related MCQs
Q. 5 is quardratic non-residue of 7.
View solution
Q. 4 is quardratic residue of 7.
View solution
Q. 8 is quardratic residue of 17.
View solution
Q. 8 is quardratic residue of 11.
View solution
Q. Which of the following is a quardratic residue of 11?
View solution
Q. What is pseudo prime number?
View solution
Q. Pseudo prime are classified based on property which they satisfy, which of the following are classes of pseudoprimes?
View solution
Q. A Least Common Multiple of a, b is defined as __________
View solution
Q. The LCM of two number 1, b(integer) are _________
View solution
Q. If a, b are integers such that a > b then lcm(a, b) lies in _________
View solution
Q. LCM of 6, 10 is?
View solution
Q. The product of two numbers are 12 and their Greatest common divisor is 2 then LCM is?
View solution
Q. If LCM of two number is 14 and GCD is 1 then the product of two numbers is?
View solution
Q. If a number is 2² x 3¹ x 5⁰ and b is 2¹ x 3¹ x 5¹ then lcm of a, b is?
View solution
Q. State whether the given statement is True or False.
LCM (a, b, c, d) = LCM(a,(LCM(b,(LCM(c, d)))).
View solution
Q. LCM(a, b) is equals to _________
View solution
Q. The lcm of two prime numbers a and b is _________
View solution
Q. A Highest Common Factor of a, b is defined as ___________
View solution
Q. The HCF of two number 1, b(integer) are _________
View solution
Q. If a,b are integers such that a > b then hcf(a, b) lies in _________
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Discrete Mathematics? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
