GATE CSE
First time here? Checkout the FAQ!
x
+6 votes
477 views

The minimum positive integer p such that 3p modulo 17 = 1 is

  1. 5
  2. 8
  3. 12
  4. 16
asked in Set Theory & Algebra by Veteran (19k points)   | 477 views

3 Answers

+6 votes
Best answer
D) fermat's little theorem
answered by Boss (6.8k points)  
selected by

How (C)

I am getting (D)

What is the need to know any theorem !!

Can't we do directly by putting 'p' ??

 

offcourse you can!
+5 votes

Fermat's Little Theorem :

a≡ a (mod p)                        

According to Modular Arithmetic    ≡ b (mod n) if their difference (a-b) is an integer multiple of n ( n divides (a-b) )

So ( ap - a ) is an integer multiple of  p , now as a is not divisible by p so definitely  ( ap-1 -1) is an integer multiple of p .this simply means if we divides ap-1  by p , the remainder would be 1 .... ap-1 modulo p = 1 

put the values in the formula.          p=17 so p-1 =16 .

answered by (411 points)  
0 votes

Using Fermats Little Theorem

p: prime 
a : integer Not prime 
then
ap-1 mod p is always 1 

Here p : 7  Hence p-1  is 16

answered by Loyal (2.6k points)  

Ur definition of a is wrong

a is any integer which is not divisible by p.

 

And 1 more typo is there p=17 not 7

Plz correct it.

 

But it doesnt guarantee that it will be minimum,or does it?
Answer:

Related questions



Top Users Mar 2017
  1. rude

    4272 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2608 Points

  5. Debashish Deka

    2254 Points

  6. 2018

    1514 Points

  7. Vignesh Sekar

    1344 Points

  8. Akriti sood

    1262 Points

  9. Bikram

    1258 Points

  10. Sanjay Sharma

    1016 Points

Monthly Topper: Rs. 500 gift card

21,454 questions
26,775 answers
60,982 comments
22,994 users