olymmath

FI-MO 1999 Problem 5

    An ordinary domino tile can be identifi ed as a pair (k,m)(k,m) where numbers kk and mm can get values 0,1,2,3,4,50, 1, 2, 3, 4, 5 and 6.6. Pairs (k,m)(k,m) and (m,k)(m, k) determine the same tile. In particular, the pair (k,k)(k, k) determines one tile. We say that two domino tiles match, if they have a common component. Generalized n-domino tiles mm and kk can get values 0,1,...,n.0, 1,... , n. What is the probability that two randomly chosen nn -domino tiles match?

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator fi-mo/1999/p5 · Tag R8DXNVYQJH · Edit this page on GitHub · Keys: j next, k previous