80 percent = 8,000 what is the answer
1 answer:
You might be interested in
<span>From the message you sent me:
when you breathe normally, about 12 % of the air of your lungs is replaced with each breath. how much of the original 500 ml remains after 50 breaths
If you think of number of breaths that you take as a time measurement, you can model the amount of air from the first breath you take left in your lungs with the recursive function
Why does this work? Initially, you start with 500 mL of air that you breathe in, so
. After the second breath, you have 12% of the original air left in your lungs, or 
. After the third breath, you have 
, and so on.
You can find the amount of original air left in your lungs after
breaths by solving for 
explicitly. This isn't too hard:
and so on. The pattern is such that you arrive at
and so the amount of air remaining after
breaths is
which is a very small number close to zero.</span>
when you breathe normally, about 12 % of the air of your lungs is replaced with each breath. how much of the original 500 ml remains after 50 breaths
If you think of number of breaths that you take as a time measurement, you can model the amount of air from the first breath you take left in your lungs with the recursive function
Why does this work? Initially, you start with 500 mL of air that you breathe in, so
You can find the amount of original air left in your lungs after
and so on. The pattern is such that you arrive at
and so the amount of air remaining after
which is a very small number close to zero.</span>
First of all, the modular inverse of n modulo k can only exist if GCD(n, k) = 1.
We have
130 = 2 • 5 • 13
231 = 3 • 7 • 11
so n must be free of 2, 3, 5, 7, 11, and 13, which are the first six primes. It follows that n = 17 must the least integer that satisfies the conditions.
To verify the claim, we try to solve the system of congruences
Use the Euclidean algorithm to express 1 as a linear combination of 130 and 17:
130 = 7 • 17 + 11
17 = 1 • 11 + 6
11 = 1 • 6 + 5
6 = 1 • 5 + 1
⇒ 1 = 23 • 17 - 3 • 130
Then
23 • 17 - 3 • 130 ≡ 23 • 17 ≡ 1 (mod 130)
so that x = 23.
Repeat for 231 and 17:
231 = 13 • 17 + 10
17 = 1 • 10 + 7
10 = 1 • 7 + 3
7 = 2 • 3 + 1
⇒ 1 = 68 • 17 - 5 • 231
Then
68 • 17 - 5 • 231 ≡ = 68 • 17 ≡ 1 (mod 231)
so that y = 68.