The average distance is 3.23!! I found this question very interesting thanks!
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:
c = 10 feet
Step-by-step explanation:
Use the Pythagorean theorem: a^2 + b^2 = c^2
<u>Step 1: Plug in the information</u>
(6)^2 + (8)^2 = c^2
36 + 64 = c^2
100 = c^2
sqrt(100) = sqrt(c^2)
<em>10 = c</em>
<em />
Answer: c = 10 feet
Answer:
462 ways
Step-by-step explanation:
The formula to use in solving this problem is given as the Combination formula
The Combination formula is given as
C(n , r) = nCr = n!/r! (n - r)!
We are told that a food bakery has 12 pies unsold at the end of the day which they intend to share to 6 food banks
n = 12, r = 6
In order to ensure that at least 1 food bank gets 1 pie, we have:
n - 1 = 12 - 1 = 11
r - 1 = 6 - 1 = 5
Hence,
C(11, 5) = 11C5
= 11!/ 5! ×(11 - 5)!
= 11!/5! × 6!
= (11 × 10 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1)/ (5 × 4 × 3 × 2 × 1) ×( 6 × 5 × 4 × 3 × 2 × 1)
= 462 ways