Difference between revisions of "2020 OIM Problems/Problem 3"

(Created page with "== Problem == Let <math>n \ge 2</math> be an integer. A sequence <math>\alpha = (a_1, a_2, \cdots , a_n)</math> of <math>n</math> integers is "''Limeña''" (from Lima, Perú)...")
 
Line 2: Line 2:
 
Let <math>n \ge 2</math> be an integer. A sequence <math>\alpha = (a_1, a_2, \cdots , a_n)</math> of <math>n</math> integers is "''Limeña''" (from Lima, Perú) if  
 
Let <math>n \ge 2</math> be an integer. A sequence <math>\alpha = (a_1, a_2, \cdots , a_n)</math> of <math>n</math> integers is "''Limeña''" (from Lima, Perú) if  
  
<cmath>gcd{a_i - a_j | a_i > a_j, 1 \le i, j \le n} = 1</cmath>
+
<cmath>gcd {a_i - a_j | a_i > a_j, 1 \le i, j \le n} = 1</cmath>
  
 
An "''operation''" consists of choosing two elements <math>a_k</math> and <math>a_l</math> of a sequence, with <math>k \ne l</math>,
 
An "''operation''" consists of choosing two elements <math>a_k</math> and <math>a_l</math> of a sequence, with <math>k \ne l</math>,

Revision as of 12:52, 14 December 2023

Problem

Let $n \ge 2$ be an integer. A sequence $\alpha = (a_1, a_2, \cdots , a_n)$ of $n$ integers is "Limeña" (from Lima, Perú) if

\[gcd {a_i - a_j | a_i > a_j, 1 \le i, j \le n} = 1\]

An "operation" consists of choosing two elements $a_k$ and $a_l$ of a sequence, with $k \ne l$, and replace $a_l$ with $a'_l$ Show that, given a collection of $2^n-1$ Limeñan sequences, each formed by $n$ integers numbers, there are two of them, say $\beta$ and $\gamma$, such that it is possible to transform $\beta$ into $\gamma$ by a finite number of operations. 'Clarification:' If all the elements of a sequence are equal, then that sequence is not Limeña.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions