the pythagoras tree is a fractal generated by squares. for each square, two new smaller squares are constructed and connected by their corners to the original square. how do i create an exponential function to find out how many squares will be in the next sequence? since every iteration, the previous amount of squares added is doubled, how can i phrase this in function form? for example: iteration 1: 0 + 1 = 1 square, iteration 2: 1 + 1(2) = 3 squares, iteration 3: 3 + 2(2) = 7 squares

pin1ta4r3k7b

pin1ta4r3k7b

Answered question

2022-11-11

the pythagoras tree is a fractal generated by squares. for each square, two new smaller squares are constructed and connected by their corners to the original square.
how do i create an exponential function to find out how many squares will be in the next sequence? since every iteration, the previous amount of squares added is doubled, how can i phrase this in function form? for example:
iteration 1: 0 + 1 = 1 square,
iteration 2: 1 + 1(2) = 3 squares,
iteration 3: 3 + 2(2) = 7 squares

Answer & Explanation

sellk9o

sellk9o

Beginner2022-11-12Added 11 answers

You are adding 2 n squares in each iteration - this means that the next term (n+1) has 2 n + 1 1 squares, as you have 2 n 1 squares till then, and 2 n + 2 n 1 = 2 n × 2 1 = 2 n + 1 1.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?