olymmath

SE-SKOLORNAS 1980 Problem 2

    a1a_1 , a2a_2 , a3a_3 , a4a_4 , a5a_5 , a6a_6 , a7a_7 and b1b_1 , b2b_2 , b3b_3 , b4b_4 , b5b_5 , b6b_6 , b7b_7 are two permutations of 1,2,3,4,5,6,71, 2, 3, 4, 5, 6, 7 . Show that ∣a1−b1∣|a_1 - b_1| , ∣a2−b2∣|a_2 - b_2| , ∣a3−b3∣|a_3 - b_3| , ∣a4−b4∣|a_4 - b_4| , ∣a5−b5∣|a_5 - b_5| , ∣a6−b6∣|a_6 - b_6| , ∣a7−b7∣|a_7 - b_7| are not all different.

    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 se-skolornas/1980/p2 · Tag X9YAMVPVDF · Edit this page on GitHub · Keys: j next, k previous