Question: This is a two player game (say with Player A and B) in which each player takes turn to select a number from 1 to
This is a two player game (say with Player A and B) in which each player takes turn to select a number from 1 to 50. In the first move, suppose the first player has selected a number, say k , then this player will score kand the other player will score the sum of all the distinct factors of other than k itself . Once a number k is selected, all the distinct factors of k (including k itself) will be removed from list 1 to 50 for further consideration. The game will be played based on this updated list of numbers and we only sum the distinct factors remained in the updated list. The game will finish when no number is left and the winner is the one who has the highest (total) score Does the first player has a winning strategy ? Explain your answer carefully
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
