MathDB
2018 Theme #6

Source:

November 13, 2018
combinatorics

Problem Statement

Farmer James invents a new currency, such that for every positive integer n≤6n\le 6, there exists an nn-coin worth n!n! cents. Furthermore, he has exactly nn copies of each nn-coin. An integer kk is said to be nice if Farmer James can make kk cents using at least one copy of each type of coin. How many positive integers less than 2018 are nice?
Back to ProblemsView on AoPS