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:
Whichever train has the greatest numbers
Step-by-step explanation:
Answer: 0.1840
Step-by-step explanation:
The binomial probability formula :-
, here n is the number total of trials , p is the probability of getting success in each trial and P(x) is the probability of getting success in x trial.
Given : The probability of the community favored building a police substation in their neighborhood = 0.64
If 14 citizens are chosen, then the probability that exactly 8 of them favor the building of the police substation will be :-
Hence, the probability that exactly 8 of them favor the building of the police substation = 0.1840
Answer:
±1, ±11, ±1/5, ±11/5
Step-by-step explanation:
f(x) = 5x³ - 7x + 11
constant term: 11
leading coefficient: 5
factors of the constant term: ±1, ±11
factors of the leading coefficient: ±1, ±5
possible rational roots = factors of the constant term/factors of the leading coefficient = ±1, ±11, ±1/5, ±11/5
