Factorization Game

#1

i do not no how to solve this . please give any hints

#2

First calculate total powers of all prime number in array. For example - in array [3 18 2 2] total powers of 2 will be 3 and powers of 3 will be 3. Now let me try to relate this problem with a classical game theory problem.

Let prime numbers are piles of stones and their total prime powers in array are equivalent to respective piles size. Now this has become a problem where two players are playing optimally and they reduce every pile to size 0. The last player unable to move loses.

I suggest you to read over internet about NIM game and let me know where you are stuck.

1 Like
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.