Answer:
The maximum cost is 41 dollars per necklace.
Step-by-step explanation:
The average cost in dollars/necklace is given by :
.....(1)
Where
x is the number of necklaces that are created
To maximize the cost, find the value of x by putting dC/dx = 0
Now put the value of x = 7 in equation (1).
Hence, the maximum cost is 41 dollars per necklace.
Answer:
(x-8y)^2
Step-by-step explanation:
I used a calculator
Triangular sequence = n(n + 1)/2
If 630 is a triangular number, then:
n(n + 1)/2 = 630
Then n should be a positive whole number if 630 is a triangular number.
n(n + 1)/2 = 630
n(n + 1) = 2*630
n(n + 1) = 1260
n² + n = 1260
n² + n - 1260 = 0
By trial an error note that 1260 = 35 * 36
n² + n - 1260 = 0
Replace n with 36n - 35n
n² + 36n - 35n - 1260 = 0
n(n + 36) - 35(n + 36) = 0
(n + 36)(n - 35) = 0
n + 36 = 0 or n - 35 = 0
n = 0 - 36, or n = 0 + 35
n = -36, or 35
n can not be negative.
n = 35 is valid.
Since n is a positive whole number, that means 630 is a triangular number.
So the answer is True.
Answer:
A. -12h² - 22h + 14
Step-by-step explanation:
(-4h +2)(3h +7) = -4h(3h +7) +2(3h +7) . . . . . . . (a +b)c = ac +bc
= (-4h)(3h) + (-4h)(7) + (2)(3h) + (2)(7) . . . . . . . a(b +c) = ab +ac . . . (twice)
= -12h² -28h +6h +14
= -12h² -22h +14 . . . . . . . . collect terms
The answer is A. I plugged it into a TI-83 calculator. If you need to know how I did that I will be happy to help
