MathDB
NMO (Nepal) Problem 1

Source:

March 17, 2024
combinatoricsnumber theory

Problem Statement

Nirajan is trapped in a magical dungeon. He has infinitely many magical cards with arbitrary MPs(Mana Points) which is always an integer Z\mathbb{Z}. To escape, he must give the dungeon keeper some magical cards whose MPs add up to an integer with at least 20242024 divisors. Can Nirajan always escape?
( Proposed by Vlad Spǎtaru, Romania)