Answer:
a+4=
Step-by-step explanation:
Answer:
4n + 4
Step-by-step explanation:
Azhar - n years old now.
Last year he was (n-1).
His mother was 4(n -1) last year.
Now his mother 4(n-1) + 1.
7 years later she will be 4(n - 1) + 1 + 7 = 4n - 4 + 8 = 4n + 4
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:
36
Step-by-step explanation:
If you set the equation up, it would be n + 5 = 41. If you subtract the 5 from both sides to get n by itself, you get n = 36.
Answer:
9.18
Step-by-step explanation: