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

1989 APMO Problems/Problem 4

Revision as of 21:56, 11 July 2021 by Satisfiedmagma (talk | contribs) (Created page with "==Problem== Let <math>S</math> be a set consisting of <math>m</math> pairs <math>(a,b)</math> of positive integers with the property that <math>1 \leq a < b \leq n</math>. Sh...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $S$ be a set consisting of $m$ pairs $(a,b)$ of positive integers with the property that $1 \leq a < b \leq n$. Show that there are at least \[4m \cdot \dfrac{(m - \dfrac{n^2}{4})}{3n}\] triples $(a,b,c)$ such that $(a,b)$, $(a,c)$, and $(b,c)$ belong to $S$.

Solution

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1989_APMO_Problems/Problem_4&oldid=158163"