Processing math: 100%

23666: HW 4

From Classes
(Difference between revisions)
Jump to: navigation, search
 
Line 1: Line 1:
'''Problem 16.''' Prove for all natural numbers n5:   2n>n2.
+
'''Problem 16.''' Prove for all natural numbers n5:$\ \ \ \ 2^n>n^2$.
  
 
'''Problem 17.''' Let nN. Conjecture a formula for the expression
 
'''Problem 17.''' Let nN. Conjecture a formula for the expression
Line 5: Line 5:
  
 
'''Problem 18.''' Use Problem 15 and induction to show that P(A) has 2n elements, when A has n elements.
 
'''Problem 18.''' Use Problem 15 and induction to show that P(A) has 2n elements, when A has n elements.
 +
 +
'''Problem 19.''' Show that every natural number greater than 33 can be written in the form 4s+5t, where s and t are natural numbers with s3 and t2.
 +
 +
'''Problem 20.''' Let a1=2, a2=4, and an+2=5an+16an for all n1. Show that an=2n for all natural numbers n.

Latest revision as of 16:35, 12 March 2019

Problem 16. Prove for all natural numbers n5:    2n>n2.

Problem 17. Let nN. Conjecture a formula for the expression an=112+123+134++1n(n+1)

and prove your conjecture by induction.

Problem 18. Use Problem 15 and induction to show that P(A) has 2n elements, when A has n elements.

Problem 19. Show that every natural number greater than 33 can be written in the form 4s+5t, where s and t are natural numbers with s3 and t2.

Problem 20. Let a1=2, a2=4, and an+2=5an+16an for all n1. Show that an=2n for all natural numbers n.

Personal tools
Namespaces

Variants
Actions
Navigation
Toolbox