Computer Science, asked by haripriya916, 11 months ago

1.There are 7 tumblers on a table, all standing upside down. You are allowed to turn any2 tumblers simultaneously in one move. Is it possible to reach a situation when all thetumblers are right side up? (Hint: The parity of the number of upside down tumblers isinvariant.)2.A knockout tournament is a series of games. Two players compete in each game; theloser is knocked out (i.e, does not play any more), the winner carries on. The winnerof the tournament is the player that is left after all other players have been knocked out.Suppose there are 1234 players in a tournament. How many games are played before thetournament winner is decided?3.King Vikramaditya has two magic swords. With one, he can cut off 19 heads of a dragon,but after that the dragon grows 13 heads. With the other sword, he can cut off 7 heads, but22 new heads grow. If all heads are cut off, the dragon dies. If the dragon has originally1000 heads can it ever die? (Hint:The number of heads mod 3 is invariant.)​

Answers

Answered by swmdwmbasumatery
0

Answer:

what is the question tells us nicely

Explanation:

wow so long question how it is possible to non then also i will try

first you do the tumblers on one side then for the other

Similar questions