Math, asked by rajesh2390, 7 months ago

Nala and Simba enter the graveyards and are attacked by the dangerous hyenas. The hyena queen thinks of a clever way of trapping them. She traps them in a dark cave with n number of magical wells. The water in n - k number of wells is poisoned and the rest k are poisonless. Simba knows which wells are poisoned and which are poisonless. Since Simba is the son of King Mufasa, he can pick a well, and make a wish to reverse the configuration of all thewellsi.e. poisoned to poisonless and viceversa) except for the one he chose. For a particular value of n, if suppose x is the minimum number of times he needs to make a wish so that in the end the maximum number of poisonless wells are present for a particular value of k. And let y is equal to the sum of all x as k varies from 0 to n (Osksn) for a particular value of n. Find the sum of all y for all the even values of n from 0 to 20? (both inclusive)

options
825

775

245

325

Answers

Answered by Anonymous
5

Answer:

Answer is 825...I can't do this with process...because it's very long....ok...don't worry it is right...ok....

Similar questions