still stuck...
on what
* operation is for set of S = {1,2,3,4,5,6} defined according table above. for integer n > 1 and satisfies x^n = x^(n-1) * x^n. what is the value of 5^2015 ?
@dan815
the table u have is for mod 7
honestly i dont know what the question asking ?
what, modulo ?
which part i can see the question is for mod 7 ?
if u look at the table, u see the numbers are the remainders for mod 7
oh, ok... 0,1,2,3,4,5,6 are remainder of mod7. i can see knw
next ?
i dont understand the n>1 and x^n.... part but i with the 5^2015 part they want to know what u get with mod 7
5^2015 mod 7 = ?
oh, i will try to get its remainder... just still process
5^2015 = 5^2014 * 5^2015, it says this equation is satisfied
5^2015 mod7 = 5 * 5^2014 mod7 = 5 * (7-2)^2014 mod7 = 5 * 2^2014 mod7 = 5 * .... opss.. sorry im forget how to using mod , can you refresh me about it ?
@ganeshie8
best mod for mod
ah, yea i have to setting 2^2014 to 2^(3 x 671 + 1), right ?
since `x^n = x^(n-1) * x^n` property is satisfied, can we also say below will hold too \[(x^m)^n = x^{mn}\]
from my process above : = 5 * 2^2014 mod7 = 5 * 2^(3 x 671 + 1) mod7 = 5 * 2 * 1 mod7 = 10 mod7 = 3 mod7 is that right ?
so, the answer is 3 :D
interesting how did all these simplifications come
@ganeshie8 , can you show your argument completly ?
btw, here the options : a. 3 b. 2 c. 1 d.0
5^x mod 7 here is something im thinking about i know that for 5^n 5*5*5*5... 5 is lacking 2 in every multiplication similiarly (7-2)^n (7-2)(7-2)(7-2)....=7^n+....+(-2)^n from binomial expansion u know that all the other terms have a 7*2 in them except the final -2^n therefore thats all we need to worry about when dividing by 7 to see the remainder
so u can get that first step atleast
5^2015 mod 7 = 2^2015 mod 7
all the other terms have a 7*
5^2015 mod 7 = \(\color{red}{-}\)2^2015 mod 7
oh right yes
now we can look at powers of 2 that is divisible 7 to break it up again?
or mabe just see where its 1!
2^3 mod 7 is 1 so
is that how u got to the stop 2^(3*671+1)
step*
-2^2015 = -2^(3*671+2) = -4*8^671
is 2^(x+n) mod 7 = 2^x mod 7 * 2^n mod 7?
But we need to first establish the property : (a^m)^n = a^(mn)
we have to establish that wrt to ths mod?
All we are given is that `x^n = x^(n-1) * x^n`
ok right
yes with respect to the defined operation on given set
what are you thinking?
nothing lol it is trivial. .
how do we establish this property then
`x^n = x^(n-1) * x^\(\large \color{Red}{^n}\) hey i notice a typo just now, that \(\large \color{Red}{^n}\) should not be there rigth ?
to me, from the property of x^n = x^(n-1) * x^n, we can establish the number of 2^2015 becomes : 5^2015 = 5 * (5 * 5 * 5 .... * 5) = 5 * 4 * (4 * 4 * .... * 4) = 6 * (2 * 2 * 2 ... * 2) =6 * 2 * (4 * 4 * ... * 4) = 5 * (2 * 2 * 2 * ... * 2) = 5 * 2 * (2 * 2 ... * 2) = 3 * (2 * 2 * ... ) = 3 * 2 * (2 * 2 * ... 2) = 6 * (2 * 2 * 2 ... 2) too long, haha ....
Join our real-time social learning platform and learn together with your friends!