olymmath

TH-TMO 2016 Problem 10

    A Pattano coin is a coin which has a blue side and a yellow side. A positive integer not exceeding 100100 is written on each side of every coin (the sides may have different integers). Two Pattano coins are identical if the number on the blue side of both coins are equal and the number on the yellow side of both coins are equal. Two Pattano coins are pairable if the number on the blue side of both coins are equal or the number on the yellow side of both coins are equal. Given 25592559 Pattano coins such that no two coins are identical. Show that at least one Pattano coin is pairable with at least 5050 other coins

    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 th-tmo/2016/p10 · Tag 4K6D8G058Q · Edit this page on GitHub · Keys: j next, k previous