Art of Problem Solving
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
During AMC 10A/12A testing, the AoPS Wiki is in read-only mode and no edits can be made.

2002 AMC 12A Problems/Problem 17: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

8 September 2022

8 November 2019

25 December 2018

27 March 2015

4 July 2013

1 July 2013

18 February 2009

  • curprev 17:5117:51, 18 February 2009 Misof talk contribs 782 bytes +782 New page: == Problem == Several sets of prime numbers, such as <math>\{7,83,421,659\}</math> use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes...
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2002_AMC_12A_Problems/Problem_17"