Answer:
11,880 different ways.
Step-by-step explanation:
We have been given that from a pool of 12 candidates, the offices of president, vice-president, secretary, and treasurer will be filled. We are asked to find the number of ways in which the offices can be filled.
We will use permutations for solve our given problem.
, where,
n = Number of total items,
r = Items being chosen at a time.
For our given scenario and
.
Therefore, offices can be filled in 11,880 different ways.
Answer:
The largest even integer is 0
Step-by-step explanation:
Given as :
The sum of four consecutive even number = - 12
Let The first even number = 2 x
The second even number = (2 x + 2)
The third even number = (2 x + 4)
The fourth even number = (2 x + 6)
<u>According to question</u>
sum of four consecutive even number = - 12
Or, 2 x + (2 x + 2) + (2 x + 4) + (2 x + 6) = - 12
Or, (2 x + 2 x + 2 x + 2 x) + (2 + 4 + 6) = - 12
Or, 8 x + 12 = - 12
Or, 8 x = - 12 - 12
Or, 8 x = - 24
∴ x =
i.e x = - 3
now, putting the value of x
The first even number = 2 × - 3 = - 6
The second even number = (2 × - 3 + 2) = - 6 + 2 = - 4
The third even number = (2 × - 3 + 4) = - 6 + 4 = - 2
The fourth even number = (2 × - 3 + 6) = - 6 + 6 = 0
So, The largest even integer = 0
Hence, The largest even integer is 0 Answer