MathCastle
Proof Writing & Problem SolvingEasy

Proof Writing & Problem Solving · Easy problem

A jar holds 100 coins. A move either adds 6 coins or removes 9 coins (only if at least 9 are there). What is the smallest number of coins the jar can ever hold?

Practice more like this