Carlos wants to write a computer program that produces the sequence that can be defined by the general term tn = n!, where n ∈N and n ≥ 1. For example, t1 = 1, t2 = 2 * 1, t3 = 3 * 2 * 1, t4 = 4 * 3 * 2 * 1, and so on. Unfortunately, the computer programming language that he is using doesn't understand the factorial symbol. It only understands recursive formulas. Which recursive formula can Carlos use in his computer program to produce the sequence?
+1
Answers (1)
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Carlos wants to write a computer program that produces the sequence that can be defined by the general term tn = n!, where n ∈N and n ≥ 1. ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Home » Mathematics » Carlos wants to write a computer program that produces the sequence that can be defined by the general term tn = n!, where n ∈N and n ≥ 1. For example, t1 = 1, t2 = 2 * 1, t3 = 3 * 2 * 1, t4 = 4 * 3 * 2 * 1, and so on.