Ihave been trying to understand why the diffie hellman key exchange algorithm works, specifically why the two exponents can be swapped in it without the result changing.

so my specific question is why:

(g^b mod m)^a mod m
= (g^a mod m)^b mod m

i know it is "because" it can be correctly rewritten as the trivially true equation:

g^(ab) mod m
= g^(ba) mod m

but that doesn't explain why it is true, i am interested in the reasoning/proof/explanation behind why the first of these equivalencies hold true.

you

answer:

(-8,7)

explanation:

we know that  

f

(

−

3

)

=

7

therefore, if we wish to get the output as 7, in the function, we need to have our input to be -3.

looking at the function  

f

(

x

+

5

)

, what should the value of x be, such that the input in the function becomes 7?

we simply equate the terms,

x

+

5

=

−

3

x

=

−

8

thus, the point on the new function would be  

(

−

8

,

7

)

answer: 16

step-by-step explanation: first you would add 6+6 which equals 12 then add 2+2 which equals 4. then add 12 + 4 which is 16.

hope this ^_^

answer: #1 ads up by 8 and i don't know #2

point m is on plane r