The recursive formula of the explicit rule an = (n + 1)² is where a1 = 4
The explicit formula is given as:
an = (n + 1)²
This means that:
a1 = (1 + 1)² = 4
a₂ = (2 + 1)² = 9
a₃ = (3 + 1)² = 16
Rewrite as:
a₂ = 4 + 2 * 2 + 1 = 9
a₃ = 9 + 2 * 3 + 1 = 16
Substitute a₂ = 9
a₃ = a₂ + 2 * 3 + 1 = 16
Express 2 as 3 - 1
a₃ = a₃₋₁ + 2 * 3 + 1
Express 3 as n
Evaluate the product
Hence, the recursive formula of the explicit rule an = (n + 1)² is where a1 = 4
Read more about explicit rules at:
#SPJ4
Answer:
x < -4 ∪ x > 4
Step-by-step explanation:
The absolute value function is shifted down 3 units. The solution space is values of x where y = |x|-3 is greater than 1. The solution is shown in red in the attachments, and the left and right (dashed) sides of the inequality are shown in blue.
__
I personally prefer to rewrite the inequality so the comparison is to <em>zero</em>. That is done in the second attachment, which rewrites it to ...
|x| -4 > 0
by subtracting 1 from both sides. It is often easier to read the values of x-intercepts than it is to read the coordinate values where lines cross each other.
