ANSWER AS QUICK AS POSSIBLE WILL GET BRAINIEST!!!!!
2 answers:
You might be interested in
- <u>Answer</u>: -180
Step-by-step explanation:
3(p2q + pq2 - pq) - 6pq + 3pq2 =
3[-20 × 2 + (-20) × 2 - (-20)] - 6 × (-20) + 3 × 2 × (-20) =
3[-40 + (-40) + 20] - 6 × (-20) + 3 × 2 × (-20) =
3(-40 - 40 + 20) - 6 × (-20) + 3 × 2 × (-20) =
3(-80 + 20) - 6 × (-20) + 3 × 2 × (-20) =
3 × (-60) - 6 × (-20) + 3 × 2 × (-20) =
-180 + 120 + 6 × (-20) =
-180 + 120 + (-120) =
-180 + 120 - 120 =
-60 - 120 = -180
Answer:
6
Step-by-step explanation:
You must find the least common multiple of their schedules.
The numbers 3 and 2 are their own prime factors, so the least common multiple of 3 and 2 is 6.
Six weekends must pass until they can both have someone over on the same night.
The number line below shows that the first time their sleepovers coincide is Week 6.
