The symbol ℤ represents the set of integers, and so g: ℤ → ℤ represents a function that takes integers as inputs and
produces integers as outputs. supose that a function g: ℤ → ℤ satisfies g(a + b) = g(a) + g(b) for al integers a
and b. is there necesarily an integer k such that g(n) = k for al integer inputs n?
a. let k = g(1). compute g(2) and g(3).
b. let n be any positive integer. compute g(n).
c. now, consider g(0). since g(0) = g(0 + 0), what can you conclude about g(0)?
d. lastly, use the fact that g(n + −n) = g(0) to learn something about g(−n), where n is any positive integer.
e. use your work above to prove that g(n) = k for every integer n. be sure to consider the fact that n could be
positive, negative, or 0.

i found two solutions,   n = 2 • ± √3 = ± 3.4641

step-by-step explanation:

answer: it's d

step-by-step explanation:

third choice down

step-by-step explanation:

the first inequality is based on the number of adults and campers, and the second inequality is based on the cost of feeding both the adult and the camper.

we know that there is room for 525 people max.   it's ok to have less than 525, but it's not ok to have more than 525, so the inequality is less than or equal to.   the number combination of adults (x) and campers (y) cannot exceed this 525 max.   therefore:

x + y ≤ 525

now we talk about cost.   it costs $9 to feed one adult, so depending upon the number of adults you have (x) depends upon how much it will cost to feed that number of adults.   same with the campers, who cost $5 to feed.   the adults can be represented by 9x and the campers can be represented by 5y.   since the budget cannot exceed 1,200, the second inequality is:

9x + 5y ≤ 1200