MathGrit
ProblemsTechniquesPricing
Sign inGet started
Back to problems

Factorial Coin Combinations Counting Nice

1925SpecialistCombinatoricsCounting Principles

HMMT November 2018 · 2018

Farmer James invents a new currency, such that for every positive integer $n \leq 6$, there exists an $n$-coin worth $n!$ cents. Furthermore, he has exactly $n$ copies of each $n$-coin. An integer $k$ is said to be nice if Farmer James can make $k$ cents using at least one copy of each type of coin. How many positive integers less than 2018 are nice?
0 students attempted0% solvedRating 1925

Related practice paths

Olympiad-Style PracticeDeep contest practice for proof-style problem solving.How to Qualify for AIMEScore goals, contest choice, and prep habits for AIME hopefuls.AIME Practice StrategyHow to improve accuracy on high-difficulty problems.

Ready to check your answer?

Create an account to submit answers, save history, and track your rating.

Progressive Hints

Unlock hints one at a time — each reveals a little more without spoiling the solution.

Step-by-Step Solutions1

Multiple solution approaches with detailed walkthroughs, unlocked after you solve the problem.

AI-Powered Grading

Instant feedback on your answer — handles fractions, decimals, and equivalent forms.

Curated problem bank

Supported tracks for AMC, AIME, MATHCOUNTS, and olympiad-style training, plus global problem sources like UKMT, Euclid, and Kangaroo.