Answer:
its impossible without getting a negative number
Step-by-step explanation:
Answer:
1.8
Step-by-step explanation:
Step-by-step explanation:
x + (x + 2) + (x + 4) + (x + 6) + (x + 8) = 135
5·x + 20 = 135
5·x = 115
x = 23
So the sequence is
23, 25, 27, 29, 31
The second number is 25.
Do you agree?
The different possible mixtures can you make is 1716
.
<u>Step-by-step explanation:</u>
Given that,
- The total number of flavors available in the shop = 13 flavors
- The number of flavors you need to choose = 6 flavors
Here, we have to use the formula for combination,
nCr = n! / r! × (n-r) !
where,
- n is the total number of flavors
- r is the number of flavors you need to choose
⇒ 13C6 = 13 ! / 6! × (13-6)!
⇒ 13! / (6! × 7!
)
⇒ 13 × 12 × 11 × 10 × 9 × 8 × 7! / (6! × 7!
)
⇒ 13 × 12 × 11 × 10 × 9 × 8 / 6!
⇒ 13 × 12 × 11 × 10 × 9 × 8 / 6 × 5 × 4 × 3 × 2 × 1
⇒ 1716
Therefore, you can 1716 different possible mixtures.
You'll have to adapt this problem statement to Brainly, as Brainly does not have the Segment Tool available.
"starts with 90 pencils" implies that the y-intercept is (0,90).
"gives away 15 pencils" implies a slope of -15 pencils per unit of time
Thus, the # of pencils Jabian still has is P(x) = 90 - (15 pencils / time unit)x
