There are 6720 ways by 8 distinguishable books be placed in 5 shelves.
According to statement
The number of books (n) is 8
The number of shelves (r) is 5
Now, we find the ways by which the 8 books be placed in 5 distinguishable shelves
From Permutation formula
P(n,r) = n! / (n-r)!
Substitute the values then
P(n,r) = 8! / (8-5)!
P(n,r) = (8*7*6*5*4*3*2*1) / (3*2*1)
P(n,r) = 8*7*6*5*4
P(n,r) = 6720
So, there are 6720 ways by 8 distinguishable books be placed in 5 shelves.
Learn more about PERMUTATION here brainly.com/question/11732255
#SPJ4
Answer:
<u><em></em></u>
Explanation:
Simulate (build a table) the growing of the number of pennies for some nights to figure out the pattern:
First night: 1 penny = 2⁰
Second night: 1 × 2 pennies = 2¹
Third night: 2 × 2 = 2²
Fourth nigth: 2² × 2 = 2³
nth night: 2ⁿ⁻¹
You want 2ⁿ⁻¹ ≥ 2,000,000,000
Which you solve in this way:
- n-1 log (2) ≥ log (2,000,000,000)
- n - 1 ≥ log (2,000,000,000) / log (2)
Since n is number of days, it is an integer number, so n ≥ 32.
Hence, she will have a total of more than $ 2 billion after 32 days.
You can prove that by calculating 2³² = 2,147,483,648.
Answer:
Yo im taking the same thing lemme know what you get!!!
Step-by-step explanation:
