Proof Error: Missing Link at n^4 Term

  • Thread starter Thread starter Link
  • Start date Start date
Link
Messages
132
Reaction score
1
What is wrong with this proof? There seems to be a missing link at the n^4 term, even though values of n up to 134 are true!

http://www.geocities.com/jake_lloyd007/ind.jpg
 
Physics news on Phys.org
without seeing it all souldn't the answers to each line read as follows:

n+6n+11n+6n

n+10n+35n+50n+24n

n+11n+41n+61n+30n (if you add the two lines above together)
 
1. You haven't told us what you are trying to prove!

2. What you posted makes no sense! In the last line, there appears to be no n on the left side, yet the right side depends on n.
 
I am trying to preform a proof by induction that for any positive number n,

1 x 2 x 3 x 4 + 2 x 3 x 4 x 5 + ...+ n (n+1)(n+2)(n+3)(n+4)

= n^4 + 6n^3 + 11n^2 + 6n

So in the image just consider the k as n.

It's a polynomial with a pretty long expansion, but I have checked and rechecked and if there is an error, I can't find one. Yet it can't be proven?
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top