f(1) = 3
f(n+1) = 2 · f(n)-1
Mathematics, 20.08.2019 00:30 jhony42
Asequence is defined recursively by the following rules:
f(1) = 3
f(n+1) = 2 · f(n)-1
which of the following statements is true about the sequence? select all that apply.
f(3) = 10
f(6) = 66
f(5) = 33
f(4) = 18
f(2)=5
Answers: 2
Another question on Mathematics
Mathematics, 21.06.2019 17:30
1mile equals approximately 1.6 kilometers. which best approximates the number of miles in 6 kilometers?
Answers: 1
Mathematics, 21.06.2019 18:30
Players on the school soccer team are selling candles to raise money for an upcoming trip. each player has 24 candles to sell. if a player sells 4 candles a profit of$30 is made. if he sells 12 candles a profit of $70 is made
Answers: 2
Mathematics, 22.06.2019 00:00
The statements below can be used to prove that the triangles are similar. ? △abc ~ △xyz by the sss similarity theorem. which mathematical statement is missing? ∠b ≅ ∠y ∠b ≅ ∠z
Answers: 2
Mathematics, 22.06.2019 01:00
Match the one-to-one functions with their inverse functions.
Answers: 1
You know the right answer?
Asequence is defined recursively by the following rules:
f(1) = 3
f(n+1) = 2 · f(n)-1
f(1) = 3
f(n+1) = 2 · f(n)-1
Questions
History, 22.10.2019 19:30
English, 22.10.2019 19:30
Computers and Technology, 22.10.2019 19:30
Computers and Technology, 22.10.2019 19:30
