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
The 30,60,90 - the hypotenuse is equal to twice the length of the shorter leg , the hypotenuse side =2x , the shortest side =x and the straight side is x square root 3
Volume of cone: pi * r^2 * h/3
Given volume, height
942in^3 = 3.14 * r^2 * 9/3
942in^2 = r^2 * 9.42
Divide by 9.42
r^2 = 100, r = -10, 10
Cannot be negative so...
Solution: radius is 10 in.
Answer:
-10
Step-by-step explanation:
First use this equation: (y2 - y1) / (x2 -x1)
The y intercept is 14 so the slope is -10.
Answer:
I cant see the photo
Step-by-step explanation:
sorry