Pile of Cards Puzzle

Logic Level 4

There are \(n\) cards numbered with consecutive whole numbers starting with 1 and up to \(n\). It is divided into two piles. What is the smallest value of \(n\) that guarantees that one stack will contain two cards whose numbers sum to a perfect square?

×

Problem Loading...

Note Loading...

Set Loading...