HMMT 2005 S1
- Team 2
- Answer
Let be integers. How many different (i.e., noncongruent) dominoes can be formed by choosing two squares of an array?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
m n-\frac{m^{2}-m+2}{2}
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.