MathDB
OMK 2010

Source: Malaysia National Olympiad 2010 Sulung Category Problem 3

June 4, 2011
combinatorics unsolvedcombinatorics

Problem Statement

Let N=abc‾N=\overline{abc} be a three-digit number. It is known that we can construct an isoceles triangle with a,ba,b and cc as the length of sides. Determine how many possible three-digit number NN there are.
(N=abc‾N=\overline{abc} means that a,ba,b and cc are digits of NN, and not N=a×b×cN=a\times b\times c.)
Back to ProblemsView on AoPS