Create the page "1998 Problem 2" on this wiki! See also the search results found.

Page title matches

• 1998 AIME Problems/Problem 2
  == Problem == [[Image:AIME_1998-2.png|thumb|300px|right]]
  6 KB (913 words) - 16:34, 6 August 2020
• 1998 AHSME Problems/Problem 2
  == Problem 2 == ...and <math>D</math> represent four different digits selected from <math>0,1,2,\ldots ,9.</math> If <math>(A+B)/(C+D)</math> is an integer that is as larg
  1,008 bytes (167 words) - 14:28, 5 July 2013
• 1998 AJHSME Problems/Problem 2
  == Problem == ...{c}</math>, what is the value of <math>\begin{tabular}{r|l}3&4 \\ \hline 1&2\end{tabular}</math>?
  797 bytes (126 words) - 15:40, 20 October 2016
• 1998 USAMO Problems/Problem 2
  == Problem == C1=circle(O,2);
  4 KB (656 words) - 17:26, 20 June 2019
• 1998 IMO Problems/Problem 2
  ==Problem== contestants. Prove that <i>k</i>/<i>a</i> ≥ (<i>b</i> − 1)/(2<i>b</i>).
  451 bytes (79 words) - 23:47, 18 November 2023
• 1998 JBMO Problems/Problem 2
  ==Problem 2== <math>\cos X = \frac{AC ^ {2} + AD ^ {2} - DC ^ {2}}{ 2 \cdot AC \cdot AD }</math>
  3 KB (554 words) - 08:31, 2 July 2020
• 1998 CEMC Gauss (Grade 7) Problems/Problem 2
  == Problem == == Solution 2==
  651 bytes (98 words) - 16:14, 15 June 2022
• 1998 APMO Problems/Problem 2
  == Problem == ...<math>b</math>, <math>(36a + b)(36b + a)</math> cannot be a power of <math>2</math>.
  2 KB (297 words) - 12:50, 22 July 2021
• 1998 OIM Problems/Problem 2
  == Problem ==
  564 bytes (96 words) - 15:39, 13 December 2023

Page text matches

• MATHCOUNTS
  ...cluding Art of Problem Solving, the focus of MATHCOUNTS is on mathematical problem solving. Students are eligible for up to three years, but cannot compete be ...er), 2-2.5 (State/National)<br><u>Target:</u> 1.5 (School), 2 (Chapter), 2-2.5 (State/National)}}
  10 KB (1,497 words) - 11:42, 10 March 2024
• American Invitational Mathematics Examination
  ...ministered by the [[Mathematical Association of America]] (MAA). [[Art of Problem Solving]] (AoPS) is a proud sponsor of the AMC! ...blem 1-5</u>: 3<br><u>Problem 6-10</u>: 4<br><u>Problem 10-12</u>: 5<br><u>Problem 12-15</u>: 6}}
  8 KB (1,057 words) - 12:02, 25 February 2024
• Constructive counting
  This is a problem where constructive counting is not the simplest way to proceed. This next e === Example 2 ===
  12 KB (1,896 words) - 23:55, 27 December 2023
• Fibonacci sequence
  ...m is the sum of the two preceding it. The first few terms are <math>1, 1, 2, 3, 5, 8, 13, 21, 34, 55,...</math>. ...ion|recursively]] as <math>F_1 = F_2 = 1</math> and <math>F_n=F_{n-1}+F_{n-2}</math> for <math>n \geq 3</math>. This is the simplest nontrivial example
  6 KB (957 words) - 23:49, 7 March 2024
• Complex number
  ...mplex numbers''' arise when we try to solve [[equation]]s such as <math> x^2 = -1 </math>. ...from this addition, we are not only able to find the solutions of <math> x^2 = -1 </math> but we can now find ''all'' solutions to ''every'' polynomial.
  5 KB (860 words) - 15:36, 10 December 2023
• AIME Problems and Solutions
  ...in the AoPSWiki, please consider adding them. Also, if you notice that a problem in the Wiki differs from the original wording, feel free to correct it. Fi | colspan="2"| [[1999 AIME | AIME]]
  3 KB (391 words) - 16:00, 21 February 2024
• Olimpiada de Mayo/1997
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1997 I Problems/Problem 1|Problem 1]]
  856 bytes (98 words) - 14:53, 3 July 2009
• 1999 AIME
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1999 AIME Problems/Problem 1|Problem 1]]
  1 KB (118 words) - 08:41, 7 September 2011
• 1998 AIME
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1998 AIME Problems]]
  1 KB (114 words) - 08:39, 7 September 2011
• 1997 AIME
  ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[1997 AIME Problems/Problem 1|Problem 1]]
  1 KB (114 words) - 08:39, 7 September 2011
• 1997 AIME Problems
  == Problem 1 == [[1997 AIME Problems/Problem 1|Solution]]
  7 KB (1,098 words) - 17:08, 25 June 2020
• 1998 AIME Problems
  {{AIME Problems|year=1998}} == Problem 1 ==
  7 KB (1,084 words) - 02:01, 28 November 2023
• 1999 AIME Problems
  == Problem 1 == [[1999 AIME Problems/Problem 1|Solution]]
  7 KB (1,094 words) - 13:39, 16 August 2020
• 1985 AIME Problems/Problem 5
  == Problem == ..., a_2, a_3, \ldots</math> is chosen so that <math>a_n = a_{n - 1} - a_{n - 2}</math> for each <math>n \ge 3</math>. What is the sum of the first 2001 te
  2 KB (410 words) - 13:37, 1 May 2022
• 1998 AIME Problems/Problem 15
  == Problem == ...have to leave the vertex, so every vertex reached is equivalent to adding 2 more segments. So the degree of each vertex must be even, with the exceptio
  9 KB (1,671 words) - 22:10, 15 March 2024
• 1998 AIME Problems/Problem 14
  == Problem == ...angular box has half the volume of an <math>(m + 2)\times(n + 2)\times(p + 2)</math> rectangular box, where <math>m, n,</math> and <math>p</math> are in
  2 KB (390 words) - 21:05, 29 May 2023
• 1998 AIME Problems/Problem 13
  == Problem == ...the sum of the complex power sums of all nonempty [[subset]]s of <math>\{1,2,\ldots,n\}.</math> Given that <math>S_8 = - 176 - 64i</math> and <math> S_
  2 KB (384 words) - 19:02, 20 October 2023
• 1998 AIME Problems/Problem 12
  == Problem == ...ivisible by the square of any [[prime]]. What is <math>a^{2} + b^{2} + c^{2}</math>?
  5 KB (876 words) - 20:27, 9 June 2022
• 1998 AIME Problems/Problem 11
  == Problem == ...that it is of the same length of a face diagonal, making it <math>20\sqrt{2}</math>.
  7 KB (1,084 words) - 11:48, 13 August 2023
• 1998 AIME Problems/Problem 10
  == Problem == <cmath>x^2 + (r-100)^2 = (r+100)^2 \Longrightarrow x = 20\sqrt{r}</cmath>
  3 KB (496 words) - 13:02, 5 August 2019

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)