LOGIN/REGISTER

New pages

From AoPSWiki

New pages
Hide bots | Show redirects
(Latest | Earliest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)
  • 14:35, 20 May 2012 ‎OSSM Math and Engineering Day (hist) ‎[493 bytes] ‎Shazi (Talk | contribs) (Created page with "OSSM math and engineering day is a math competition held at OSSM, a Science and math school located in Oklahoma City, Oklahoma. It is for any 6-8th grade students. In January, sc...")
  • 23:32, 15 May 2012 ‎2010 AMC 8 Problems/Problem 18 (hist) ‎[536 bytes] ‎WolfOfAtlantis (Talk | contribs) (Created page with "The ratio of AD to AB is 3:2 and AB=30 inches. <math>If 30=2, then x=3. x=45. </math> The area of the rectangle is <math>45*30= 1350</math>. The semicircles, when combined, have...")
  • 16:15, 15 May 2012 ‎1951 AHSME Problems/Problem 47 (hist) ‎[1,141 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == If <math>r</math> and <math>s</math> are the roots of the equation <math>ax^2+bx+c=0</math>, the value of <math> \frac{1}{r^{2}}+\frac{1}{s^{2}} </math> is: <math>...")
  • 15:59, 15 May 2012 ‎1988 USAMO Problems/Problem 5 (hist) ‎[509 bytes] ‎1=2 (Talk | contribs) (Created page with "==Problem== Let <math>p(x)</math> be the polynomial <math>(1-x)^a(1-x^2)^b(1-x^3)^c\cdots(1-x^{32})^k</math>, where <math>a, b, \cdots, k</math> are integers. When expanded in po...")
  • 15:58, 15 May 2012 ‎1988 USAMO Problems/Problem 4 (hist) ‎[1,540 bytes] ‎1=2 (Talk | contribs) (Created page with "==Problem== <math>\Delta ABC</math> is a triangle with incenter <math>I</math>. Show that the circumcenters of <math>\Delta IAB</math>, <math>\Delta IBC</math>, and <math>\Delta ...")
  • 15:58, 15 May 2012 ‎1988 USAMO Problems/Problem 3 (hist) ‎[479 bytes] ‎1=2 (Talk | contribs) (Created page with "==Problem== Let <math>X</math> be the set <math>\{ 1, 2, \cdots , 20\}</math> and let <math>P</math> be the set of all 9-element subsets of <math>X</math>. Show that for any map ...")
  • 15:57, 15 May 2012 ‎1988 USAMO Problems/Problem 2 (hist) ‎[324 bytes] ‎1=2 (Talk | contribs) (Created page with "==Problem== The cubic polynomial <math>x^3+ax^2+bx+c</math> has real coefficients and three real roots <math>r\ge s\ge t</math>. Show that <math>k=a^2-3b\ge 0</math> and that <ma...")
  • 14:49, 15 May 2012 ‎1988 USAMO Problems/Problem 1 (hist) ‎[527 bytes] ‎1=2 (Talk | contribs) (Created page with "==Problem== The repeating decimal <math>0.ab\cdots k\overline{pq\cdots u}=\frac mn</math>, where <math>m</math> and <math>n</math> are relatively prime integers, and there is at ...")
  • 14:46, 15 May 2012 ‎1997 PMWC Problems/Problem T4 (hist) ‎[586 bytes] ‎1=2 (Talk | contribs) (Created page with "==Problem== In one morning, a ferry traveled from Hong Kong to Kowloon and another ferry traveled from Kowloon to Hong Kong at a different speed. They started at the same time an...")
  • 14:44, 15 May 2012 ‎1997 PMWC Problems/Problem T9 (hist) ‎[248 bytes] ‎1=2 (Talk | contribs) (darn this is hard)
  • 22:28, 12 May 2012 ‎MATHCOUNTS historical results (hist) ‎[181 bytes] ‎Minimario (Talk | contribs) (Created page with "* [http://mathcounts.org/document.doc?id=624 2011 results] * [http://mathcounts.org/document.doc?id=520 2010 results] * [http://mathcounts.org/document.doc?id=1336 2009 results]")
  • 07:32, 12 May 2012 ‎2008 iTest Problems/Problem 6 (hist) ‎[820 bytes] ‎AlcumusGuy (Talk | contribs) (Created page with "==Problem== Let <math>L</math> be the length of the altitude to the hypotenuse of a right triangle with legs 5 and 12. Find the least integer greater than <math>L</math>. ==Solu...")
  • 14:14, 11 May 2012 ‎1951 AHSME Problems/Problem 44 (hist) ‎[1,021 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == If <math> \frac{xy}{x+y}= a,\frac{xz}{x+z}= b,\frac{yz}{y+z}= c </math>, where <math> a, b, c </math> are other than zero, then <math>x</math> equals: <math> \tex...")
  • 19:36, 10 May 2012 ‎Test (hist) ‎[20 bytes] ‎Levans (Talk | contribs) (Created page with "This is a test page.")
  • 09:58, 10 May 2012 ‎2002 Romanian NMO Problems (hist) ‎[9,892 bytes] ‎1=2 (Talk | contribs) (Created page with "== 7th Grade == === Problem 1 === Eight card players are seated around a table. One remarks that at some moment, any player and his two neighbours have altogether an odd number o...")
  • 09:42, 10 May 2012 ‎2001 Romanian NMO Problems (hist) ‎[1,949 bytes] ‎1=2 (Talk | contribs) (Empty template page to make creating the other 10 pages easier.)
  • 15:03, 7 May 2012 ‎2006 Romanian NMO Problems/Grade 10/Problem 1 (hist) ‎[4,277 bytes] ‎1=2 (Talk | contribs) (added problem)
  • 11:33, 6 May 2012 ‎2012 Romanian NMO (hist) ‎[1,899 bytes] ‎1=2 (Talk | contribs) (Created page with "'''2012 Romanian National Olympiad''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. ...")
  • 11:32, 6 May 2012 ‎2011 Romanian NMO (hist) ‎[1,898 bytes] ‎1=2 (Talk | contribs) (Created page with "'''2011 Romanian National Olympiad''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. *...")
  • 11:32, 6 May 2012 ‎2010 Romanian NMO (hist) ‎[1,900 bytes] ‎1=2 (Talk | contribs) (Created page with " '''2010 Romanian National Olympiad''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. ...")
  • 11:31, 6 May 2012 ‎2009 Romanian NMO (hist) ‎[1,899 bytes] ‎1=2 (Talk | contribs) (Created page with "'''2009 Romanian National Olympiad''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. ...")
  • 11:31, 6 May 2012 ‎2008 Romanian NMO (hist) ‎[1,899 bytes] ‎1=2 (Talk | contribs) (Created page with "'''2008 Romanian National Olympiad''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. ...")
  • 11:26, 6 May 2012 ‎2007 Romanian NMO (hist) ‎[1,899 bytes] ‎1=2 (Talk | contribs) (Created page with "'''2007 Romanian National Olympiad''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. ...")
  • 11:26, 6 May 2012 ‎2005 Romanian NMO (hist) ‎[1,899 bytes] ‎1=2 (Talk | contribs) (Created page with "'''2005 Romanian National Olympiad''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. ...")
  • 11:25, 6 May 2012 ‎2004 Romanian NMO (hist) ‎[1,899 bytes] ‎1=2 (Talk | contribs) (Created page with "'''2004 Romanian National Olympiad''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. ...")
  • 11:25, 6 May 2012 ‎2003 Romanian NMO (hist) ‎[1,899 bytes] ‎1=2 (Talk | contribs) (Created page with "'''2003 Romanian National Olympiad''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. ...")
  • 11:24, 6 May 2012 ‎2002 Romanian NMO (hist) ‎[1,899 bytes] ‎1=2 (Talk | contribs) (Created page with "'''2002 Romanian National Olympiad''' problems and solutions. The first link contains the full set of test problems. The rest contain each individual problem and its solution. ...")
  • 11:24, 6 May 2012 ‎2001 Romanian NMO (hist) ‎[1,898 bytes] ‎1=2 (Talk | contribs) (Created page)
  • 19:58, 29 April 2012 ‎2006 AMC 8 Problems/Problem 25 (hist) ‎[1,475 bytes] ‎Brightknight (Talk | contribs) (Created page with "==Solution== Notice that 44 and 38 are both even, while 59 is odd. If any odd prime is added to 59, an even number will be obtained. However, the only way to obtain this even nu...")
  • 19:32, 29 April 2012 ‎2006 AMC 8 Problems/Problem 24 (hist) ‎[616 bytes] ‎Brightknight (Talk | contribs) (Created page with "CDCD = CD*101, so ABA = 101. Therefore, A = 1 and B = 0, so A+B=1+0=1.")
  • 08:59, 29 April 2012 ‎1951 AHSME Problems/Problem 23 (hist) ‎[609 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == The radius of a cylindrical box is <math> 8</math> inches and the height is <math> 3</math> inches. The number of inches that may be added to either the radius or t...")
  • 08:58, 29 April 2012 ‎1951 AHSME Problems/Problem 22 (hist) ‎[473 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == The values of <math> a</math> in the equation: <math> \log_{10}(a^2 \minus{} 15a) \equal{} 2</math> are: <math> \textbf{(A)}\ \frac {15\pm\sqrt {233}}{2} \qquad\t...")
  • 08:57, 29 April 2012 ‎1951 AHSME Problems/Problem 21 (hist) ‎[497 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == Given: <math> x > 0, y > 0, x > y</math> and <math> z\not \equal{} 0</math>. The inequality which is not always correct is: <math> \textbf{(A)}\ x \plus{} z > y \p...")
  • 08:57, 29 April 2012 ‎1951 AHSME Problems/Problem 20 (hist) ‎[720 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == When simplified and expressed with negative exponents, the expression <math> (x \plus{} y)^{ \minus{} 1}(x^{ \minus{} 1} \plus{} y^{ \minus{} 1})</math> is equal to...")
  • 08:56, 29 April 2012 ‎1951 AHSME Problems/Problem 19 (hist) ‎[505 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == A six place number is formed by repeating a three place number; for example, <math> 256256</math> or <math> 678678</math>, etc. Any number of this form is always ex...")
  • 08:56, 29 April 2012 ‎1951 AHSME Problems/Problem 18 (hist) ‎[551 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == The expression <math> 21x^2 \plus{} ax \plus{} 21</math> is to be factored into two linear prime binomial factors with integer coefficients. This can be one if <mat...")
  • 08:55, 29 April 2012 ‎1951 AHSME Problems/Problem 17 (hist) ‎[509 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == Indicate in which one of the following equations <math> y</math> is neither directly nor inversely proportional to <math> x</math>: <math> \textbf{(A)}\ x \plus{} ...")
  • 08:54, 29 April 2012 ‎1951 AHSME Problems/Problem 15 (hist) ‎[417 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == The largest number by which the expression <math> n^3 \minus{} n</math> is divisible for all possible integral values of <math> n</math>, is: <math> \textbf{(A)}\ ...")
  • 08:54, 29 April 2012 ‎1951 AHSME Problems/Problem 14 (hist) ‎[790 bytes] ‎1=2 (Talk | contribs) (…. What category would this problem fall into?)
  • 08:53, 29 April 2012 ‎1951 AHSME Problems/Problem 13 (hist) ‎[537 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == <math> A</math> can do a piece of work in <math> 9</math> days. <math> B</math> is <math> 50\%</math> more efficient than <math> A</math>. The number of days it tak...")
  • 08:52, 29 April 2012 ‎1951 AHSME Problems/Problem 12 (hist) ‎[425 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == At <math> 2: 15</math> o'clock, the hour and minute hands of a clock form an angle of: <math> \textbf{(A)}\ 30^{\circ} \qquad\textbf{(B)}\ 5^{\circ} \qquad\textbf{...")
  • 08:51, 29 April 2012 ‎1951 AHSME Problems/Problem 10 (hist) ‎[707 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == Of the following statements, the one that is incorrect is: <math> \textbf{(A)}\ \text{Doubling the base of a given rectangle doubles the area.}</math> <math> \text...")
  • 08:51, 29 April 2012 ‎1951 AHSME Problems/Problem 9 (hist) ‎[667 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == An equilateral triangle is drawn with a side of length <math> a</math>. A new equilateral triangle is formed by joining the midpoints of the sides of the first one....")
  • 08:49, 29 April 2012 ‎1951 AHSME Problems/Problem 7 (hist) ‎[696 bytes] ‎1=2 (Talk | contribs) (Created page with "== Problem == An error of <math> .02''</math> is made in the measurement of a line <math> 10''</math> long, while an error of only <math> .2''</math> is made in a measurement of ...")
  • 15:15, 26 April 2012 ‎1968 IMO Problems/Problem 5 (hist) ‎[1,119 bytes] ‎Lightest (Talk | contribs) (Created page with "==Problem 5== Let <math>f</math> be a real-valued function defined for all real numbers <math>x</math> such that, for some positive constant <math>a</math>, the equation <cmath>...")
  • 23:34, 25 April 2012 ‎2012 USAMO Problems (hist) ‎[3,107 bytes] ‎Kubluck (Talk | contribs) (Created page with "=Day 1= ==Problem 1== Find all integers <math>n \ge 3</math> such that among any <math>n</math> positive real numbers <math>a_1</math>, <math>a_2</math>, <math>\dots</math>, <mat...")
  • 18:03, 25 April 2012 ‎2012 USAJMO Problems/Problem 5 (hist) ‎[1,299 bytes] ‎Nsato (Talk | contribs) (Created page with "== Problem == For distinct positive integers <math>a</math>, <math>b < 2012</math>, define <math>f(a,b)</math> to be the number of integers <math>k</math> with <math>1 \le k < 2...")
  • 17:57, 25 April 2012 ‎2012 USAJMO Problems/Problem 4 (hist) ‎[3,739 bytes] ‎Nsato (Talk | contribs) (Created page with "== Problem == Let <math>\alpha</math> be an irrational number with <math>0 < \alpha < 1</math>, and draw a circle in the plane whose circumference has length 1. Given any integ...")
  • 17:55, 25 April 2012 ‎2012 USAMO Problems/Problem 6 (hist) ‎[869 bytes] ‎Nsato (Talk | contribs) (Created page with "== Problem == For integer <math>n \ge 2</math>, let <math>x_1</math>, <math>x_2</math>, <math>\dots</math>, <math>x_n</math> be real numbers satisfying <cmath>x_1 + x_2 + \dots ...")
  • 17:54, 25 April 2012 ‎2012 USAMO Problems/Problem 5 (hist) ‎[3,202 bytes] ‎Nsato (Talk | contribs) (Created page with "== Problem == Let <math>P</math> be a point in the plane of triangle <math>ABC</math>, and <math>\gamma</math> a line passing through <math>P</math>. Let <math>A'</math>, <math...")
(Latest | Earliest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)