gb7nash
Homework Helper
- 804
- 1
I did number 2 a little differently. Without much rigor, supposing that f(x) = anxn + ... + a0:
f(0): a0 = odd
f(1): an + ... + a0 = odd
Case 1: the root (call it b) is even
So anbn + ... a1b is even since b is even, causing arbitrary akbk (k>0) to be even. a0 is odd, so we have an odd number. -> <-
Case 2: the root is odd
Since for any ak, if ak is even, akbk is still even. If ak is odd, akbk is still odd. So since by (2) , anbn + ... a1b is odd. -> <-
That's certainly much cleaner than my approach.
f(0): a0 = odd
f(1): an + ... + a0 = odd
Case 1: the root (call it b) is even
So anbn + ... a1b is even since b is even, causing arbitrary akbk (k>0) to be even. a0 is odd, so we have an odd number. -> <-
Case 2: the root is odd
Since for any ak, if ak is even, akbk is still even. If ak is odd, akbk is still odd. So since by (2) , anbn + ... a1b is odd. -> <-
Vanadium 50 said:Too much work. Think about the parity of the problem - i.e. what it looks like mod 2. In Z2, if P(1) = 1 (odd), and P(0) = 1 (odd), then P(n) = 1 for all n. Therefore P(n) is never 0. QED.
That's certainly much cleaner than my approach.
Last edited: