This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: briey. 8. Let x Z . Prove the following: 2 x 2 + x + 1 is even i x is odd. 9. Let m,n Z . Show that there doesnt exist an integer k such that (3 m +2)(3 n +2) = 3 k +2. 10. Let x R . Prove the following: If  x1  < 1 then  x 24 x + 3  < 3 11. Let h a n  n N i be the sequence dened recursively as follows: a 1 = 1 a n +1 = a n + 3 n ( n + 1) for n N Prove that a n = n 3n + 1 for all n N . 12. Show that n N the following holds: n X k =1 2 k = 2 n +12 13. Recall that the Fibonacci Numbers are dened by f = 0, f 1 = 1 and f n = f n1 + f n2 for all n > 1. Show that for every natural number n the following holds: 2 n1 f + 2 n2 f 1 + ... + 2 f n1 = 2 nf n +2...
View Full
Document
 Spring '07
 GHEORGHICIUC
 Math, Natural Numbers

Click to edit the document details