Your soccer team is holding a silent auction dinner as a fundraiser to pay for the team uniforms. The list shows all the expenses for the silent auction. A tablet that costs $280
Soccer tickets that cost $100
A gift card that costs $20
The cost of the food is $400
The members of the soccer team will be selling tickets to the silent auction. A ticket to the silent auction includes chances to win prizes and dinner. The ticket cost is set so that 50 tickets will pay for the cost of the prizes and food.

Question 1
Part A

Build a function that can be used to find the total profit, f(x), the soccer team earns by selling x tickets. Show your work to build this function.

Question 2
Part B

Your soccer team needs to raise at least $500 more than the total cost of the expenses. What is the minimum number of tickets that must be sold in order for your team to reach their goal? Use mathematics to justify your answer.

The answer to this problem would be 900$.

WHY?:

I already did this question myself!!

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol

< xcy ≅ < xby

step-by-step explanation:

in δcax and δbax,

so, δcax ≅ δbax (side-angle-side or sas)

since δcax ≅ δbax, we can conclude < acx ≅ < abx

in δacy and δaby,

so, δacy ≅ δaby (side-angle-side or sas)

since δacy ≅ δaby, we can conclude < acy ≅ < aby

now,

< acy ≅ < aby

=> < acx + < xcy ≅ < abx + < xby

=> < acx + < xcy ≅ < acx + < xby   (since < acx ≅ < abx already proved above)

subtracting < acx from both sides, we get

< acx + < xcy -< acx ≅ < acx + < xby -< acx

cancelling out < acx and -< acx from both sides, we get

< xcy ≅ < xby (proved)