Giselle enjoys playing chess and Scrabble. She wants to play a total of at least 10 games (condition A), but she has only 6 hour
s to do it (condition B)
The graph represents the constraints on the number of chess games C and Scrabble games S Giselle plays.
What is the greatest number of chess games Giselle can play while meeting both constraints?
The graph represents the constraints on the number of chess games C and Scrabble games S Giselle plays.
What is the greatest number of chess games Giselle can play while meeting both constraints?
1 answer:
You might be interested in
Answer:
Find ur attachment here plz thankyou
Step-by-step explanation:
Answer:
x = - 3 ±
Step-by-step explanation:
Given
4x² + 24x = 4 ( divide through by 4 )
x² + 6x = 1
To complete the square
add ( half the coefficient of the x- term )² to both sides
x² + 2(3)x + 9 = 1 + 9
(x + 3)² = 10 ( take the square root of both sides )
x + 3 = ± ( subtract 3 from both sides )
x = - 3 ±