If you're trying to simplify, 3 5/8+ 2 7/8 = 6 4/8. So 10 1/8 + 6 4/8 is 16 5/8
Answer:
16, 8, 23
Step-by-step explanation:
2x+x+x+15=47
4x+15=47
4x=32
x=8
2x=16
x+15=23
Answer:
Step-by-step explanation:
2+8+3_5x1
Answer:
10/20
Step-by-step explanation:
10 times 20 is 200 which would give you 10/20
hope I did this right
Recall Euler's theorem: if
, then

where
is Euler's totient function.
We have
- in fact,
for any
since
and
share no common divisors - as well as
.
Now,

where the
are positive integer coefficients from the binomial expansion. By Euler's theorem,

so that
