Download presentation

Presentation is loading. Please wait.

Published byJaylynn Surman Modified over 2 years ago

1

2
Buena Park Junior High Advanced Algebra Math

3
A:B: Consistent, No solution Incontinent, no solution If two lines are parallel, how should they be classified? C:D: Inconsistent, no solution Conceited, no solution

4
C: Inconsistent, no solution

5
A:B: (2, 4) consistent, independent (4, 2) inconsistent, independent Solve: and classify by graphing: X + Y = 6 3X - 4Y = 4 C:D: (4, 2) consistent, dependent (4,2) consistent, independent

6
D) (4, 2) consistent, independent

7
A:B: C:D: Solve by substitution: y = 3x - 12 2x + 3y = -3 (3, -3) ( -3, 3) ( 0, -1) (6, 6)

8
Transitive Property A: (3, -3)

9
A:B: ( -2, -1) ( -1, -2) Solve by elimination: 2x - 5y = 1 3x - 4y = -2 C:D: No solution Infinite number of solutions

10
A: ( -2, -1)

11
A:B: (0, 0), (4,0), (3, 1), (0, 4) (0,0), (2,0), (3, 1), (4, 0) C:D: (0, 0), (2, 0), (0, 4), (3, 1)(0, 0), (2, 0), (1, 3), (0, 4) What are the vertices of this system?

12
C: (0, 0), (2, 0), (0, 4), (3, 1)

13
A:B: x + y = 7 4x = 5y + 1 x + y = 7 4x + 1 = 5y Write a system of equations for the following: The sum of two numbers is 7. Four times the first number is one more than five times the second. C:D: x + y = 7 5x = 4y + 1 x + y = 7 4x = 5y - 1

14
A: x + y = 7 4x = 5y + 1

15
A:B: They are parallel lines They will intersect in one point If a system is consistent dependent, what can be said about the graph of the system? C:D: The lines are coincidental They consistently need each other.

16
C: The lines are coincidental

17
A:B: 50x + 75y 2500 Misha has a 2500 meter spool of rope that he must cut into 50 meter and 75 meter lengths for his rock climbing class. Write an inequality that will express the possible numbers of each length he can cut from this spool of rope. C:D: 2500/50x 75y50x 2500 - 75y

18
B: 50x + 75y 2500

19
A:B: X 0 Y 0 3x + 1.5 y 18 2x +.75y 7.5 X 0 Y 0 3x + 2y 18 1.5x +.75y 7.5 A company produces windows and doors. A profit of $5 is realized on each window, an $3 on each door. The company has 18 hours available for manufacturing at plant A where it takes 3 hours for each window and 2 hours for each door. Plant B has 7.5 hours available for assembly where it takes 1.5 hours for each window, and.75 hours for each door. Write the constraints for this problem. C:D: X 0 Y 0 5x + 3 y 18 2x + 1.5y 7.5 You must be kidding me.

20
B: X 0 Y 0 3x + 2y 18 1.5x +.75y 7.5

21
A:B: 01 How many solutions does this system have? 2x - 3y = 11 6x - 9y = 33 C:D: 2Infinite

22
D: Infinite

23
A:B: X =2c -b +aX= 2c + b/a Solve for x. C:D: X = (2c + b)/a Huh???

24
C: X = (2c + b)/a

25
A:B: X 6 Solve: 6(x - 4) 6 + x C:D: X 6 X = 6

26
B: X 6

27
A:B: A slide of 2 up, 3 left, and a vertical stretch by a factor of 5. A slide of 2 up, 3 right and a vertical stretch by a factor of 5 Y = 5(x - 3) + 2 Describes what transformations on y = x? C:D: A slide of 2 up, 3 right and a vertical stretch by a factor of 1/5 A slide of 2 up, 3 right and a vertical compression by a factor of 1/5.

28
A slide of 2 up, 3 right and a vertical stretch by a factor of 5

29
A:B: The maximum is 23 The maximum is 25 If a feasible region has its vertices at ( -2, 0), (3, 3), (6, 2) and ( 5, 1), what is the maximum given this objective function. P = 3x + 2.5y C:D: The maximum is 27 The minimum is -6

30
A: The maximum is 23

31
A:B: X + y 5000 X 3000 Y 4000 X 0 Y 0 X + y 5000 X 3000 Y 4000 C:D: X + y 5000 X 3000 Y 4000 X 0 Y 0 X + y 5000 X 3000 Y 4000 X 0 Y 0 A ticket office sells reserved tickets and general admission tickets to a rock concert. The auditorium normally holds no more than 5000 people. There can be no more than 3000 reserved tickets and no more than 4000 general admission tickets sold. Write a system of inequalities to represent the possible combinations of reserved tickets and general admission tickets that can be sold.

32
A: X + y 5000 X 3000 Y 4000 X 0 Y 0

33
Great Job!!!! Great Job!!!! Thank you for playing! Thank you for playing!

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google