Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2006 Romanian NMO Problems/Grade 8/Problem 2

Revision as of 10:33, 27 July 2006 by Chess64 (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $n$ be a positive integer. Prove that there exists an integer $k$, $k\geq 2$, and numbers $a_i \in \{ -1, 1 \}$, such that

$n = \sum_{1\leq i < j \leq k } a_ia_j$.

Solution

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2006_Romanian_NMO_Problems/Grade_8/Problem_2&oldid=8567"