Answer:
4, 8, 16, 32, 64
Step-by-step explanation:
The nth term of a geometric sequence is
= a₁
Given
a₇ = 256 and a₁₀ = 2048 , then
a₁ = 256 → (1)
a₁ = 2048 → (2)
Divide (2) by (1)
=
r³ = 8 ( take the cube root of both sides )
r = = 2
Substitute r = 2 into (1)
a₁ × = 256
a₁ × 64 = 256 ( divide both sides by 64 )
a₁ = 4
Then
a₁ = 4
a₂ = 2a₁ = 2 × 4 = 8
a₃ = 2a₂ = 2 × 8 = 16
a₄ = 2a₃ = 2 × 16 = 32
a₅ = 2a₄ = 2 × 32 = 64
Two main facts are needed here:
1. The logarithm , regardless of the base of the logarithm, exists for
.
2. The square root exists for
.
(in both cases we're assuming real-valued functions only)
By (2) we know that exists if
, or
.
By (1), we know that exists if
, or
. But as long as the square root exists, it will always be positive, so this condition will always be met.
Ultimately, then, we only require , so the function has domain
.
To determine the range, we need to know that, in their respective domains, and
increase monotonically without bound. We also know that
at minimum, at which point the square root term vanishes, so the least value the function takes on is
. Then its range would be
.