Answer: whats the question
Step-by-step explanation: put a image on the question
Because all 3 sides are given for both triangles you can use the SSS theorem
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:
364.5
Step-by-step explanation:
you would need a calculator for it, unless you can do exponential math at such a degree... if you're using a PC there's a good graphing calculator at Desmos.com, it can show you how a graph looks, which shows that when n is 7, the answer is 364.5. also it wouldn't be 1093.5 because the exponent is n-1 which means that while n could be 7, you need to take away 1 before using it as an exponent.
