BasicSequence GeneratingFunction Challenging

Problem - 4337

Let $\mathbb{N}$ be the set containing all positive integers. Is it possible to partition $\mathbb{N}$ to more than one but still a finite number of arithmetic sequences with no two having the same common difference?


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error