Difference between revisions of "Main Page"

Line 1: Line 1:
 
__NOTOC__  __NOEDITSECTION__  <div class="frontlink" style="background-color:#204079; color:#ffffff; font-size: 110%; padding-left:15px; padding-right:15px; padding-bottom:10px;  margin-left: 5px; box-shadow: 2px 2px 6px #ccc;"> <span style="font-size: 200%">'''Welcome to the AoPS Wiki!'''</span>
 
__NOTOC__  __NOEDITSECTION__  <div class="frontlink" style="background-color:#204079; color:#ffffff; font-size: 110%; padding-left:15px; padding-right:15px; padding-bottom:10px;  margin-left: 5px; box-shadow: 2px 2px 6px #ccc;"> <span style="font-size: 200%">'''Welcome to the AoPS Wiki!'''</span>
 
   
 
   
The AoPS Wiki project is administered by the [[Art_of_Problem_Solving|<span style="color:#83a1d6;">Art of Problem Solving</span>]] for supporting educational content useful to avid math students. Please do not discuss the 2015 AMC 8 Competition on any website until November 25th.
+
The AoPS Wiki project is administered by the [[Art_of_Problem_Solving|<span style="color:#83a1d6;">Art of Problem Solving</span>]] for supporting educational content useful to avid math students.  
 
</div>
 
</div>
 
   
 
   

Revision as of 11:14, 1 December 2015

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?


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.