4, 7 and 9 are mutually coprime, so you can use the Chinese remainder theorem.
Start with
Taken mod 4, the last two terms vanish and we're left with
We have 
, so we can multiply the first term by 3 to guarantee that we end up with 1 mod 4.
Taken mod 7, the first and last terms vanish and we're left with
which is what we want, so no adjustments needed here.
Taken mod 9, the first two terms vanish and we're left with
so we don't need to make any adjustments here, and we end up with 
.
By the Chinese remainder theorem, we find that any 
such that
is a solution to this system, i.e. 
for any integer 
, the smallest and positive of which is 149.
Answer:
log9
Step-by-step explanation:
hello :
note : a>0 and b>0
1) log(ab) = loga+logb
2) loga^n = nloga.....n in N
log(9x^5) + 5 log (1/x) = log(9x^5) + log (1/x)^5 = log((9x^5) (1/x)^5)
= log(9x^5)/(x^5)) = log9 because : (1/x)^5 = 1/x^5
Answer:
x = 4
Step-by-step explanation:
4(5x - 2) = 72
Do the distributive property
20x - 8 = 72
Then add 8 to both sides to get 20x alone
20x - 8 = 72
+ 8 + 8
20x = 80
Then divide both sides by 20 to get x
x = 4
Answer:
w = -10
Step-by-step explanation:
w + 4 = (-6)
Subtract 4 from each side
w+4-4 = -6-4
w = -10
I’m stuck in the same one!!
Step-by-step explanation:
