2013 OIM Problems/Problem 3

Revision as of 14:32, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == Let <math>A = \left\{1, 2, 3, \cdots , n\right\}</math> with <math>n > 5</math>. Prove that there exists a finite set <math>B</math> of distinct positive integer...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $A = \left\{1, 2, 3, \cdots , n\right\}$ with $n > 5$. Prove that there exists a finite set $B$ of distinct positive integers such that $A \subseteq  B$ and has the property

\[\prod_{x \in B}^{}x=\sum_{x \in B}^{}x^2\]

That is, the product of the elements of B is equal to the sum of the squares of the elements of B.

~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