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:0.614
Step-by-step explanation:
Given
Probability he will miss flight if it rains=0.06
Probability he will miss flight it does not rain=0.01
Given the probability of rain=0.21
Therefore Probability that it will not rain=1-0.21=0.79
Probability that he will miss the flight 
P(actual raining and he missed the flight| he miss the flight)

<span><span>29, 31, 33, & 25. Those are all odd and if added up equal 128
</span><span>
</span></span>
Answer:
H
Step-by-step explanation:
Once graphed, the line passes through (-4,2) while the others do not