A club pays a fixed 5 dollars plus 2 dollars per visit, has at most 27 dollars and needs at least 3 visits. Let x be the integer visit count. Form the restrictions and find all feasible counts.
- “And” means the conditions hold at the same time.
- Mark each restriction separately before taking their overlap.
- Preserve open/closed endpoints and impose an integer restriction only when the situation requires it.
- Cost gives , and need gives .
- The cost limit is ; intersect to get .
- Every integer from 3 through 11 is feasible; both extreme counts meet the budget.
, .
Check your work
- Use the given conditions and show a justified intermediate step.
- State and check the requested result accurately.