Exercise 8.4.1

For n N , let

N# = n + ( n 1 ) + ( n 1 ) + + 2 + 1
(a)
Without looking ahead, decide if there is a natural way to define 0 # . How about ( 2 ) # ? Conjecture a reasonable value for 7 2 # .
(b)
Now prove n# = 1 2 n ( n + 1 ) for all n N , and revisit part (a).

Answers

(a)
Noting that N# = ( N 1 ) # + N and 1 # = 1 , we could have 0 # = 0 , 1 # = 0 , and 2 # = 1 . 7 2 # could just be defined to be the result from linearly interpolating between 3 # = 6 and 4 # = 10 to get 8 .
(b)
This is obviously true for n = 1 , and
( n + 1 ) # = n + 1 + n# = n + 1 + 1 2 n ( n + 1 ) = ( n + 1 ) ( 1 + n 2 ) = ( n + 1 ) ( n + 2 2 )

which proves the formula by induction.

User profile picture
2022-01-27 00:00
Comments