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

Page title matches

• 1998 AIME Problems/Problem 3
  == Problem == [[Image:AIME_1998-3.png|right|thumb|300px]]
  1 KB (198 words) - 20:13, 23 February 2018
• 1998 USAMO Problems/Problem 3
  == Problem == {{USAMO newbox|year=1998|num-b=2|num-a=4}}
  2 KB (322 words) - 13:31, 23 August 2023
• 1998 AHSME Problems/Problem 3
  == Problem 3 == &\ \texttt{c 7 3} \end{tabular}</math></center>
  1 KB (230 words) - 19:46, 10 March 2015
• 1998 AJHSME Problems/Problem 3
  ==Problem== <math>\dfrac{\dfrac{3}{8} + \dfrac{7}{8}}{\dfrac{4}{5}} = </math>
  590 bytes (62 words) - 00:09, 31 March 2015
• 1998 IMO Problems/Problem 3
  ===Problem=== It's possible for 1 (1/1) and 3 <math>(5/3 * 9/5)</math>, which suggests that it may be possible for all odd integers,
  3 KB (571 words) - 02:39, 17 September 2024
• 1998 JBMO Problems/Problem 3
  ...>b + 2 = a^b</math>. This equation has only the solutions <math>b = 1, a = 3</math> and <math>b = 2, a = 2</math>. Therefore, our only solutions are <math>x = 3^{1 + 1} = 9, y = 3^1 = 3</math>, and <math>x = 2^{2+1} = 8, y = 2^1 = 2</math>, and we are done.
  1 KB (212 words) - 01:34, 18 September 2020
• 1998 CEMC Gauss (Grade 7) Problems/Problem 3
  == Problem == If <math>S = 6\times 10,000 + 5\times 1,000 + 4\times 10 + 3\times 1</math>, what is <math>S</math>?
  445 bytes (53 words) - 20:05, 4 March 2021
• 1998 APMO Problems/Problem 3
  == Problem == ...c{b}{c})(1+\frac{c}{a}) \geq 2(1+\frac{a+b+c}{\sqrt[\leftroot{-2}\uproot{2}3]{abc}})</math>.
  582 bytes (106 words) - 13:41, 22 July 2021
• 1998 OIM Problems/Problem 3
  == Problem ==
  481 bytes (74 words) - 15:41, 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 ...ics]]. The focus of MATHCOUNTS curriculum is in developing [[mathematical problem solving]] skills.
  11 KB (1,517 words) - 14:11, 2 March 2025
• Constructive counting
  This is a problem where constructive counting is not the simplest way to proceed. This next e === Example 3 ===
  13 KB (2,018 words) - 15:31, 10 January 2025
• Fibonacci sequence
  ...s the sum of the two preceding it. The first few terms are <math>1, 1, 2, 3, 5, 8, 13, 21, 34, 55,...</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 of a [[linear recursion]]
  7 KB (1,111 words) - 14:57, 24 June 2024
• Complex number
  ...hat the imaginary part of a complex number is real: for example, <math>\Im(3 + 4i) = 4</math>. So, if <math>z\in \mathbb C</math>, we can write <math>z *[[2007 AMC 12A Problems/Problem 18]]
  5 KB (860 words) - 15:36, 10 December 2023
• 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 == ...osen 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 terms of this sequence if the sum
  2 KB (406 words) - 11:20, 15 February 2025
• 1998 AIME Problems/Problem 15
  == Problem == ...3,5 .</math> Label the vertices of a regular <math>n</math> -gon <math>1,2,3, \ldots, n .</math> Each domino is thereby represented by a directed segmen
  9 KB (1,659 words) - 18:35, 20 June 2024
• 1998 AIME Problems/Problem 14
  == Problem == ...actors of <math>9</math> are <math>(1,9)(3,3)</math>. These give <math>m = 3, n = 11</math> and <math>m = 5, n = 5</math> respectively. Substituting int
  2 KB (390 words) - 21:05, 29 May 2023
• 1998 AIME Problems/Problem 13
  == Problem == ...n,</math> its complex power sum is defined to be <math>a_1i + a_2i^2+ a_3i^3 + \cdots + a_ni^n,</math> where <math>i^2 = - 1.</math> Let <math>S_n</mat
  2 KB (385 words) - 16:47, 14 September 2024
• 1998 AIME Problems/Problem 12
  == Problem == ...math> gives <math>x = \frac {\sqrt {5} - 1}{2}</math> and <math>y = \frac {3 - \sqrt {5}}{2}</math>.
  5 KB (884 words) - 14:33, 18 June 2024
• 1998 AIME Problems/Problem 9
  == Problem == ...ints. Intuitively, the average probability will occur at <math>\frac{\frac{3}{2}m}{60} = \frac{m}{40}</math>.
  4 KB (624 words) - 22:27, 4 February 2025
• 1998 AIME Problems/Problem 8
  == Problem == | 0 || 1 || 2 || 3 || 4 || 5 || 6
  2 KB (354 words) - 13:19, 14 December 2024
• 1998 AIME Problems/Problem 7
  == Problem == Note that this is an algebraic bijection, we have simplified the problem and essentially removed the odd condition, so now we can finish with plain
  5 KB (684 words) - 18:52, 19 June 2024
• 1998 AIME Problems/Problem 4
  == Problem == Nine tiles are numbered <math>1, 2, 3, \cdots, 9,</math> respectively. Each of three players randomly selects an
  5 KB (917 words) - 02:37, 12 December 2022

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