172k views
0 votes
What is the recursive formula for the amount of boxes?

What is the recursive formula for the amount of boxes?-example-1
User Bee San
by
8.0k points

2 Answers

1 vote

Explanation:

Let the box be x

x¹ = 1

x ² = 4

x³ = 9

Here, we can notice that the no. of boxes are in the term of square .

x n = (2n-1 ) + an - 1 is the formula

x ¹ = 1

x ² = (2 × 2 - 1) + 1 = 4

x ³ = ( 2 ×3 -1 ) + 4 = 9

x ⁴ = ( 2 × 4 - 1 ) + 9 = 16

User AjayLohani
by
7.7k points
4 votes

Answer:

an = (2n-1) + a(n-1)

a1 =1

Explanation:

a1 =1

a2 = 4

a3 = 9

We can see that the number of boxes is the term number squared

an = n^2 is the explicit formula

an = (2n-1) + an-1

a1 =1

Check

a1=1

a2 = (2*2-1)+1 =3+1 =4

a3 = (2*3-1)+4 =5+4 =9

a4 = (2*4-1)+9 =7+9 =16

User Jake Burkhead
by
8.0k points

No related questions found

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories