Answer:
3/9 and 6/9
Step-by-step explanation:
3/9 is simplified to 1/3
6/9 is simplified to 2/3
Hmm, there are 5 letters
if you cannot repeat the letters
hmm, let's find how many for 4 letters
there are 4! or 4*3*2*1=24
that's how many ways there are to arrange a,b,c, d
now we can multiply it by 4 because there are 4 choices for the last place (e is not included0
24*4=56
answer is 56 different arrangements
What you would do is -10+5=-5 then you add 4+7= 11 then you mutiply them answers together 11*-5=-55 hope this helps you
Answer: 12 friends.
Step-by-step explanation:
the data we have is:
Mei Su had 80 coins.
She gave the coins to her friends, in such a way that every friend got a different number of coins, then we have that:
The maximum number of friends that could have coins is when:
friend 1 got 1 coin
friend 2 got 2 coins
friend 3 got 3 coins
friend N got N coins
in such a way that:
(1 + 2 + 3 + ... + N) ≥ 79
I use 79 because "she gave most of the coins", not all.
We want to find the maximum possible N.
Then let's calculate:
1 + 2 + 3 + 4 + 5 = 15
15 + 6 + 7 + 8 + 9 + 10 = 55
now we are close, lets add by one number:
55 + 11 = 66
66 + 12 = 78
now, we can not add more because we will have a number larger than 80.
Then we have N = 12
This means that the maximum number of friends is 12.
Answer:
V=2c
Step-by-step explanation:
![\\[Looking at the relationship of the numbers in the table, we can see which ones will work right off the bat.]\\[Our first numbers are both zero, so we cant do anything significant there.]\\[Next row, however, we can start doing the process of elimination.]\\\left[\begin{array}{ccc}1&2\\2&4\\3&6\\4&8\\5&10\end{array}\right]\\ \\[After plugging in the formulas to see if they're true, the only one that works every time is V=2c.]\\[That is your answer.]](https://tex.z-dn.net/?f=%5C%5C%5BLooking%20at%20the%20relationship%20of%20the%20numbers%20in%20the%20table%2C%20we%20can%20see%20which%20ones%20will%20work%20right%20off%20the%20bat.%5D%5C%5C%5BOur%20first%20numbers%20are%20both%20zero%2C%20so%20we%20cant%20do%20anything%20significant%20there.%5D%5C%5C%5BNext%20row%2C%20however%2C%20we%20can%20start%20doing%20the%20process%20of%20elimination.%5D%5C%5C%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D1%262%5C%5C2%264%5C%5C3%266%5C%5C4%268%5C%5C5%2610%5Cend%7Barray%7D%5Cright%5D%5C%5C%20%5C%5C%5BAfter%20plugging%20in%20the%20formulas%20to%20see%20if%20they%27re%20true%2C%20the%20only%20one%20that%20works%20every%20time%20is%20V%3D2c.%5D%5C%5C%5BThat%20is%20your%20answer.%5D)
