Mathematics

  • AMC Problems
  • Proofs Without Words

Resources

  • Academic Competitions
  • Academic Scholarships
  • Math Competition Resources
  • Math Summer Programs
  • Art of Problem Solving FAQ

Tutorials

  • LaTeX Tutorial
  • Asymptote Tutorial (LaTeX Graphics)
  • Python Programming Tutorial

Problem of the Week

2002 AMC 12A, Problem 17

Several sets of prime numbers, such as $\{7,83,421,659\}$ use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have?

Recent Changes

Special:SimpleChanges/5

  • More...

New to the AoPS Wiki?

If you don't know much about how to edit a wiki, you might want to read the tutorial and the help files. You can also read what AoPSWiki is not. Lastly, please read the policies of the AoPSWiki before editing, and why AoPSWiki is different from other online resources.

AoPSWiki runs on the MediaWiki software.

This article is issued from Artofproblemsolving. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.