Skip to content
AlmostSurely
Course Problems
Brainteasers and Pure Mathematics› Invariants, Extremal Arguments and Recursion› 30.2 Pigeonhole and Extremal Principles
Problem 30.10 ★★★Medium Coming soon

Most Coins Without Change for a Dollar

Coming soon for subscribers

This problem and its full worked solution will be part of the AlmostSurely subscription. The free problems are open now, with complete solutions.

Try 30.6 Socks for a Matching Pair
Previous30.9 Maximum Product Partition Next30.11 The Taxman Game

Section 30.2

Pigeonhole and Extremal Principles Toolkit
  1. 30.6Socks for a Matching Pair
  2. 30.7Pirates Aiming Cannons
  3. 30.8Forcing a Heavy Row
  4. 30.9Maximum Product Partition
  5. 30.10Most Coins Without Change for a Dollar
  6. 30.11The Taxman Game
  7. 30.12Largest Coprime Subset Sum
AlmostSurely

Quant interview problems, taught by technique.

CourseProblemsTermsPrivacy