Answer:
56 days
Explanation:
where A is final amount, Ao is initial amount, t is time taken, h is half life
Here given:
initial amount: 400 millicuries
final amount: 3.125 millicuries
half life: 8 days
time taken: ?
Hence solve for time taken:
<u>insert values given</u>
<u>divide both sides by 400</u>
<u>apply exponent rule</u>
<u />
<u>simplify</u>
<u>multiply both sides by 8</u>
Complete question is;
Given n objects are arranged in a row. A subset of these objects is called unfriendly, if no two of its elements are consecutive. Show that the number of unfriendly subsets of a k-element set is ( n−k+1 )
( k )
Answer:
I've been able to prove that the number of unfriendly subsets of a k-element set is;
( n−k+1 )
( k )
Step-by-step explanation:
I've attached the proof that the number of unfriendly subsets of a k-element set is;
( n−k+1 )
( k )
<em>Answer:</em>
y=-4x+2
<em>Step-by-step explanation:</em>
<em>B is the y-intercept and M is the sope, or x, knowing this now we slove:</em>
<em>(-4, 2)</em>
<em>m b</em>
<em>y=mx+b</em>
y=-4x+2
<em>Have a beautiful day!</em> v(⌒o⌒)v♪
For more help take a look at the picture below.
Answer:
5536 calculators
Step-by-step explanation:
We integrate the function dx/dt to obtain the number of new calculators between beginning of the 3rd week and end of week 4. Note that beginning of 3rd week is the same as end of 2nd week. So, =
Let u = t + 12, then = 1. So, du = dt. We also change the limits of our integration. So, when t = 2, u = 2 + 12 = 14 and when t = 4, u = 4 + 12 = 16
Then = ∫₁₄¹⁶
₁₄¹⁶ =
≈ 5536 calculators