Difference between revisions of "Main Page"
| Line 3: | Line 3: | ||
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. | 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> | ||
| − | + | ||
<div style="display:block;background-color:darkred;padding:10px;color:white;text-align:center;margin-top:10px;"> | <div style="display:block;background-color:darkred;padding:10px;color:white;text-align:center;margin-top:10px;"> | ||
| − | During | + | During AIME testing, the AoPS Wiki is in read-only mode. No edits can be made. |
</div> | </div> | ||
| − | + | ||
<div style="display:flex;"> | <div style="display:flex;"> | ||
<div style="flex:1"> | <div style="flex:1"> | ||
Revision as of 18:41, 11 March 2020
Welcome to the AoPS Wiki!
The AoPS Wiki project is administered by the Art of Problem Solving for supporting educational content useful to avid math students.
During AIME testing, the AoPS Wiki is in read-only mode. No edits can be made.
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.
