Answer:
A is for apple
Step-by-step explanation:
abc
Answer:
15 jumbo muffins.
Step-by-step explanation:
If you need 1/3 cups of flour for each jumbo muffin and have 5 cups of flour. Multiply 3 and 5 which will give you 15 which is how many jumbo muffins you can make.
If they took 2/3 away you have 1/3 left. you would have 7 left.
If
![n](https://tex.z-dn.net/?f=n)
is an integer, you can use induction. First show the inequality holds for
![n=1](https://tex.z-dn.net/?f=n%3D1)
. You have
![2^1=2>1](https://tex.z-dn.net/?f=2%5E1%3D2%3E1)
, which is true.
Now assume this holds in general for
![n=k](https://tex.z-dn.net/?f=n%3Dk)
, i.e. that
![2^k>k](https://tex.z-dn.net/?f=2%5Ek%3Ek)
. We want to prove the statement then must hold for
![n=k+1](https://tex.z-dn.net/?f=n%3Dk%2B1)
.
Because
![2^k>k](https://tex.z-dn.net/?f=2%5Ek%3Ek)
, you have
![2^{k+1}=2\times2^k>2k](https://tex.z-dn.net/?f=2%5E%7Bk%2B1%7D%3D2%5Ctimes2%5Ek%3E2k)
and this must be greater than
![k+1](https://tex.z-dn.net/?f=k%2B1)
for the statement to be true, so we require
![2k>k+1](https://tex.z-dn.net/?f=2k%3Ek%2B1)
for
![k>1](https://tex.z-dn.net/?f=k%3E1)
. Well this is obviously true, because solving the inequality gives
![3k>1\implies k>\dfrac13](https://tex.z-dn.net/?f=3k%3E1%5Cimplies%20k%3E%5Cdfrac13)
. So you're done.
If you
![n](https://tex.z-dn.net/?f=n)
is any real number, you can use derivatives to show that
![2^n](https://tex.z-dn.net/?f=2%5En)
increases monotonically and faster than
![n](https://tex.z-dn.net/?f=n)
.