Answer:

Step-by-step explanation:
We will prove by mathematical induction that, for every natural n,

We will prove our base case (when n=1) to be true:
Base case:
As stated in the qustion, 
Inductive hypothesis:
Given a natural n,

Now, we will assume the inductive hypothesis and then use this assumption, involving n, to prove the statement for n + 1.
Inductive step:
Let´s analyze the problem with n+1 stones. In order to move the n+1 stones from A to C we have to:
- Move the first n stones from A to C (
moves). - Move the biggest stone from A to B (1 move).
- Move the first n stones from C to A (
moves). - Move the biggest stone from B to C (1 move).
- Move the first n stones from A to C (
moves).
Then,
.
Therefore, using the inductive hypothesis,

With this we have proved our statement to be true for n+1.
In conlusion, for every natural n,

Answer:
Should be 82% sorry if I'm wrong have a amazing day
Yes
Reason
Each simplified is 2:5
Answer:
C. 4000
Step-by-step explanation:
let the number of females be : x
number of males be: 10000-x
(10000-x)*105/100 + x*106/100 =10540
10000*105/100 - 105x/100 + 106x/100 =10540
100*105 + x/100 =10540
x/100 =10540-10500
x =40*100
x =4000
Hope this helps!