The table shows the number of yards of ribbon needed to make different numbers of bows.
1 answer:
You might be interested in
Given the system of equations below:
The first equation is y-isolated so we can substitute in the second equation.
Use the distribution property to expand in and simplify.
The another method is to divide the second equation by 2.
Arrange in the form of y = mx+b.
When we finally arrange, compare the equation to the first equation. Both equations are the same which mean that both graphs are also same and intersect each others infinitely.
For more information, when the both sides are equal for equation - the answer would be infinitely many. If both sides aren't equal (0 = 4 for example) - the answer would be none. If the equation can be solved for a variable then it'd be one solution.
Answer
- Infinitely Many
Hope this helps. Let me know if you have any doubts!
Answer:
1) Domain: { 1,2,3,4,5,6}
Range: {12,24,36,48,60,72}
2) First four terms are: 2,5,8,11
3) First four terms are: 8,13,20,29
4) First four terms are: 0,0,2,6
5) First four terms are: 0,1,1.41,1.73
Step-by-step explanation:
1.
n 1 2 3 4 5 6
f(n) 12 24 36 48 60 72
Domain: { 1,2,3,4,5,6}
Range: {12,24,36,48,60,72}
Write first four terms of each sequence
2) f(n)=3n-1
Put n = 1, 3(1)-1 = 3-1 = 2
Put n = 2, 3(2)-1 = 6-1 = 5
Put n = 3, 3(3)-1 = 9-1 = 8
Put n = 4, 3(4)-1 = 12-1 = 11
So, First four terms are: 2,5,8,11
3) f(n)=n^2+2n+5
Put n = 1, (1)^2+2(1)+5= 1+2+5 = 8
Put n = 2, (2)^2+2(2)+5 = 4+4+5= 13
Put n = 3, (3)^2+2(3)+5 = 9+6+5 = 20
Put n = 4, (4)^2+2(4)+5 = 16+8+5 = 29
So, First four terms are: 8,13,20,29
4) f(n)=(n-1)(n-2)
Put n = 1, (1-1)(1-2) = 0(-1) = 0
Put n = 2, (2-1)(2-2) = 1(0) = 0
Put n = 3, (3-1)(3-2) = 2(1) = 2
Put n = 4, (4-1)(4-2) = 3(2) = 6
So, First four terms are: 0,0,2,6
5) f(n) =
Put n=1
Put n=2
Put n=3
Put n=4
So, First four terms are: 0,1,1.41,1.73