a.

By Fermat's little theorem, we have


5 and 7 are both prime, so
and
. By Euler's theorem, we get


Now we can use the Chinese remainder theorem to solve for
. Start with

- Taken mod 5, the second term vanishes and
. Multiply by the inverse of 4 mod 5 (4), then by 2.

- Taken mod 7, the first term vanishes and
. Multiply by the inverse of 2 mod 7 (4), then by 6.


b.

We have
, so by Euler's theorem,

Now, raising both sides of the original congruence to the power of 6 gives

Then multiplying both sides by
gives

so that
is the inverse of 25 mod 64. To find this inverse, solve for
in
. Using the Euclidean algorithm, we have
64 = 2*25 + 14
25 = 1*14 + 11
14 = 1*11 + 3
11 = 3*3 + 2
3 = 1*2 + 1
=> 1 = 9*64 - 23*25
so that
.
So we know

Squaring both sides of this gives

and multiplying both sides by
tells us

Use the Euclidean algorithm to solve for
.
64 = 3*17 + 13
17 = 1*13 + 4
13 = 3*4 + 1
=> 1 = 4*64 - 15*17
so that
, and so 
Answer:
y=-7
Step-by-step explanation:
hope that will help you
The answer is 1/3 is the answer.
Answer:
The answer would be
H = A over L times W
Step-by-step explanation:
This is because, when you multiply the L, W, and H you end up getting A. This means that A is the biggest number. We automatically can tell that H is what were looking for so putting those two things together we have this: H = A over ???
The ??? would have to be L times W because those are the only things left and they get multiplied together which in the end leaves us with
H = A over L times w
aka
H=A/LxW
Answer:
Equation: x × -2 = y
Solution: y = 12
Step-by-step explanation:
if (x = 2) is (y = -4) then (x = 1) is (y = -2) so if (x = -6) is (y = 12) if we follow the equation [x × -2 = y] which was found using the first set of variables and dividing each by 2.