TFW 2:45 PM 9 docs.google.com 377.02 Computer Algorit... how that n(n+1)(2n+1) is divisible by 6 so that he formula, 6 so that the formula 2-0 makes sense.) Student email: how [do] you want us to show you the work for HW#1? Are we to pick random numbers and show the equalities? Reply Consider the formula f(n) - n2 -79 n +1601( -40n-40)+ 41 which gives a prime number for 80 consecutive values of n, I think o - 79 Does that prove that it always gives primes? No. Legendre (1752-1833) already proved that no polynomial can do that. (In fact, f(8o)- 40 2+40+41-41 2) So, your question. Can you prove a claim by showing that it works for a few values? Patently not