Answer:There’s a that you can download with a ton of edginuity answers if you type down edginuity answers and hit the pdf by reservamesa and you can find some.
Step-by-step explanation:
You must try to remove one of the unknown variables from the system by multiplying one in a way that when adding (or subtracting) one to another “makes it disappear” and so whatever value you get can be substituted back in to get the other unknown!
The total of all the purchases is $73.94. The remaining balance on the card is $26.06. Hope this helps!
Answer:
i don't know nothing about that
<h2>
Answer with explanation:</h2>
We are asked to prove by the method of mathematical induction that:

where n is a positive integer.
then we have:

Hence, the result is true for n=1.
- Let us assume that the result is true for n=k
i.e.

- Now, we have to prove the result for n=k+1
i.e.
<u>To prove:</u> 
Let us take n=k+1
Hence, we have:

( Since, the result was true for n=k )
Hence, we have:

Also, we know that:

(
Since, for n=k+1 being a positive integer we have:
)
Hence, we have finally,

Hence, the result holds true for n=k+1
Hence, we may infer that the result is true for all n belonging to positive integer.
i.e.
where n is a positive integer.