Hello everyone, I need your help with two problems, I would make separate threads for them but both are pretty much the same thing. They are from Gelfand's Algebra book.
Problem 133: You know that . Compute (a) ; (b) .
I solved problem 133 with quadratic equation and got the numbers but, since in this book, I haven't learned how to use quadratic equation yet, I think that this has to be solved by other way, in a way which will also help me to prove the next problem.
Problem 134: You know that is an integer. Prove that is an integer for any
Thanks in advance.
Thank you DeMath and Plato, that was so easy, I feel stupid, I thought about squaring both sides but don't know why I didn't do it. Anyway, thanks for help.
I'm trying to do the next problem, that I also listed above, without luck.. because I have no experience with proofs, and there's lot's of proofs to do in this book, some are easy some are little harder, now I perfectly understand how to solve this problem by computing in higher powers, thanks to you, I've done it when n=4,5,6; but listing all of this solutions won't prove that every answer will be an integer, so can you also help me to write a proof?
I.e., you fix and assume that for all . From that assumption you deduce that . As was said above, it is sufficient to assume the induction hypotheses not for all , but for k = n and k = n - 1. Note that since you checked the statement for n = 1 and 2 in the base case and the induction step proceeds for , we have , so the statements for n - 1 and n were established either in the base case or during the previous iteration of the induction step.
For problem 134:
Let . We're given that .
Prove that is an integer for all (thus actually for all given the particually pretty symmetry).
Observe that, for any integer :
. Thus .
Since , and are all integers (using problem 133), it's a trivial induction to show that (so actually for all integers n).
Note that finding this recursion first, along with the obvious and , would've solved problem 133 quickly ( ).
Think of a line of dominoes, and how it would look if this line extended indefinitely. It should be obvious that any domino falling over will push the next one, which will push the next, which will push the next, and continue pushing the next domino indefinitely. But this will only happen if the first domino is pushed in the first place.
Mathematical induction works the same way. You need to show that the statement is true for some base case (this is the equivalent of pushing over the first domino) and you also need to show an inductive step, that if an arbitrary case is true, that the next case will be true as well (this is the equivalent of any domino pushing the next one over).
In your case, you have already been told that is an integer. Your base case would be to show that is an integer.
which is another integer, so the base case is true.
Now for the inductive step, we need to assume that the statement is true for some arbitrary value of , say , and prove that IF this is true, then the next one, will also be true.
So we are assuming and using this to show .
Does that make more sense? See if you can go from here?
I did this:
Since , and , .
So since we assumed that , this also assumes that , right? if so..
Since & , , and we assumed that , so , which means that , which means that right? Is this proof accurate, if so, Big thanks to you Prove It, johnsomeone and emakarov : )