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

AoPS Wiki:Problem of the Day/September 6, 2011

< AoPS Wiki:Problem of the Day
Revision as of 08:23, 7 September 2011 by Negativebplusorminus (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

The integers $a,b,c,d$ satisfy $a > b > c > d$ and \[a + b + c + d = 2048 \ \textrm{ and }\ a^2 - b^2 + c^2 - d^2 = 2048.\] Find the smallest possible value of $a$.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=AoPS_Wiki:Problem_of_the_Day/September_6,_2011&oldid=42191"