Professional Documents
Culture Documents
In Fib(6)= 8
exercises 1 and 2, determine whether
the argument is an example of inductive Fib (7)= 13
or deductive reasoning. Fib(8)= 21
1. Two computer programs, a
bubble sort and a shell sort, are Fib(9)= 34
used to sort data. In each of 50
Fib(10)= 55
experiments, the shell sort
program took less time to sort 5. In each of the following,
the data than the bubble sort determine the nth-term
program. Thus the shell sort formula for the number of
program is the faster of the two square tiles in the nth figure.
sorting programs.
-1 9 23 43 69 10 48
8 14 20 26 32 38
6 6 6 6 6
Answer: 293
Answer: An = 4n
4. List the first 10 terms of the
Fibonacci sequence.
Answer: Fib(1) = 1 𝑎1 = 4( 1)
Fib(2)= 1 𝑎1 = 4
Fib(3)= 2
Fib(4)= 3 𝑎2 = 4( 2)
Fib(5)= 5 𝑎2 = 8
𝑎3 = 4( 3)
𝑎3 = 12 𝑎5 = 3(5) + 1
𝑎5 = 16
𝑎4 = 4( 4)
𝑎4 = 16 6. A sequence has an nth-term formula of
( )𝑛 𝑛(𝑛 − 1)
𝑎𝑛 = −1 ( )
𝑎5 = 4( 5) 2
Use the nth-term formula to determine
𝑎5 = 20 the first 5 terms and the 105 th term in
the sequence.
Answer:
𝑎 𝑛 𝑛(𝑛 − 1)
𝑛= ( −1) ( )
2
Answer:
𝑎2 = 3(2) + 1
𝑎3= ( −1)3 (3(3 − 1))
𝑎2 = 7 2
𝑎3 = 3(3) + 1 𝑎3= 3
𝑎3 = 10
𝑎 ( −1)105
105(105 − 1)
105= ( )
2
𝑎105= − 5460
GIVEN:
𝑎3 = 2(3 − 1 ) + 3 − 2
𝑎3 = 5
𝑎5 = 2(5 − 1 ) + 5 − 2
𝑎5 = 11
(𝑥−4)(𝑥+3)
𝑥−4 = 𝑥+3
2009-2010 : 796-740 = 56
2010-2011 : 740-717 = 23
2011-2012 : 717-723 = -6
2012-2013 : 723-700 = 23