GATE CSE
First time here? Checkout the FAQ!
x
+5 votes
369 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 (18.3k points)   | 369 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!
+3 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 (391 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 Active (1.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.

 

Answer:

Related questions

Top Users Jan 2017
  1. Debashish Deka

    7090 Points

  2. Habibkhan

    4676 Points

  3. Vijay Thakur

    4224 Points

  4. saurabh rai

    4014 Points

  5. sudsho

    3982 Points

  6. Arjun

    3138 Points

  7. GateSet

    3088 Points

  8. santhoshdevulapally

    3004 Points

  9. Bikram

    2976 Points

  10. Sushant Gokhale

    2824 Points

Monthly Topper: Rs. 500 gift card

18,816 questions
23,786 answers
51,458 comments
20,133 users