The recursive function is f(n + 1) = 2f(n) where f(1) = 4
<h3>How to determine the recursive function?</h3>
From the graph, we have the following values
f(1) = 4
f(2) = 8
f(3) = 12
Divide f(2) by f(1) to calculate the rate (r)
r = f(2)/f(1)
r = 8/4
r= 2
Substitute r= 2 in r = f(2)/f(1)
f(2)/f(1) = 2
Make f(2) the subject
f(2) = 2f(1)
Express 2 as 1 + 1
f(1 + 1) = 2f(1)
Express 1 as n
f(n + 1) = 2f(n)
Hence, the recursive function is f(n + 1) = 2f(n) where f(1) = 4
Read more about recursive function at:
brainly.com/question/1275192
#SPJ1
honestly I have no idea what the answer is but I need so more points so I decided to do the question
NO
Using the Pythagorean Theorem: 7^2 + 10^2 = c^2. c thus equals sqrt(149) = 12.206555
Product: 787 = 1 x 787 = 787
Largest sum: 1 + 787 = 788
Enter a problem...
Calculus Examples
Popular Problems Calculus Find the Domain and Range f(x)=5x-3
f
(
x
)
=
5
x
−
3
The domain of the expression is all real numbers except where the expression is undefined. In this case, there is no real number that makes the expression undefined.
Interval Notation:
(
−
∞
,
∞
)
Set-Builder Notation:
{
x
|
x
∈
R
}
The range is the set of all valid
y
values. Use the graph to find the range.
Interval Notation:
(
−
∞
,
∞
)
Set-Builder Notation:
{
y
|
y
∈
R
}
Determine the domain and range.
Domain:
(
−
∞
,
∞
)
,
{
x
|
x
∈
R
}
Range:
(
−
∞
,
∞
)
,
{
y
|
y
∈
R
}