Find the value of 64 divided by 2 times 16

Mathematics

1 answer:

harkovskaia [24]3 years ago

4 0

512 is 64/2 x 16 in the end.

You might be interested in

I need 10-12<br> It would be a huge help

AVprozaik [17]

Answer:

10. 4/23

11. 18/23

12. 19/23

Step-by-step explanation:

In order to find any of these, first note the total amount of fruit. When you add all the types together you get 115 pieces of fruit. Now for each probability, divide the number of fruit that fit the description by the amount total.

20 apples/ 115 total = 4/23

90 non-pears/ 115 total = 18/23

95 non-apples/ 115 tota = 19/23

4 0

2 years ago

resent a combinatorial argument for this identity by considering a set of n people and determining, in two ways, the number of p

kifflom [539]

The committee can be selected by combinatorial argument in

$\sum ^{n}_{k=1} k(^n_k).$ ways.

A counting-based argument is known as a combinatorial argument or combinatorial proof. This line of reasoning has previously been used, for instance in the section on Stirling numbers of the second sort.

By initially selecting k individuals from our group of n, we can then choose one of those k individuals to serve as the committee's chairperson.

A number of methods for completing the first task, k methods for completing the second task, and so on. ways to create a k-member committee with a chairperson.

$\sum ^{n}_{k=1} k(^n_k).$ is the number of methods to construct a committee with a chairman of size less than or equal to n can be found by adding up over 1≤k≤n.

A committee of size less than or equal to n can also be formed with a chairperson by selecting the chairperson first, followed by the members of the committee. The chairperson can be chosen from among n options. The picker has two options for the remaining n-1 individuals: to include them or not. We therefore have n options for the chairperson, 2 options for the following, 2 options for the following, etc. These can be multiplied together to give us $n2^{n-1}$ , which is a proof of the identity.