Question

For my theory of computation class, we are supposed to do some review/practice problems to work off the rust and make sure we are ready for the course. Some of the problems are induction proofs. I did this at one time, but apparently it has completely escaped me. I've watched a couple tutorials, but still can't do problem 'a'. If anyone can walk me through the first problem I'm pretty sure I could figure out the second one on my own. Any help would be appreciated!

enter image description here

Was it helpful?

Solution

First verify it holds for n = 1.

Then assume it is true for n = x ( the sum of the first x squares ) and then try to compute the sum of the the first x + 1 squares. You know the result for the first x, you just add the last square to that sum. From there it should be easy.

And you posted on the wrong site.

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top