Search results
Create the page "1998 Problem 4" on this wiki! See also the search results found.
Page title matches
- == Problem == ...and an odd tile. Thus, since there are <math>5</math> odd tiles and <math>4</math> even tiles, the only possibility is that one player gets <math>3</ma5 KB (917 words) - 02:37, 12 December 2022
- == Problem == {{AHSME box|year=1998|num-b=3|num-a=5}}714 bytes (95 words) - 14:28, 5 July 2013
- ==Problem== {{AJHSME box|year=1998|num-b=3|num-a=5}}709 bytes (94 words) - 00:28, 5 July 2013
- == Problem == ...h pair has one black and one white square. Each move can fix at most <math>4</math> pairs, so we need at least <math>97</math> moves. However, we start1 KB (202 words) - 18:56, 10 May 2023
- {{IMO box|year=1998|num-b=3|num-a=5}}1 KB (204 words) - 01:50, 28 August 2024
- {{JBMO box|year=1998|num-b=3|after = Last Problem|five=}}1 KB (247 words) - 01:14, 7 October 2020
- == Problem 4 ==743 bytes (90 words) - 18:28, 12 May 2024
- == Problem ==518 bytes (83 words) - 15:42, 13 December 2023
Page text matches
- ...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
- This is a problem where constructive counting is not the simplest way to proceed. This next e ...proceed with the construction. If we were to go like before and break the problem down by each box, we'd get a fairly messy solution.13 KB (2,018 words) - 15:31, 10 January 2025
- ...="text-align:right">([[2000 AMC 12 Problems/Problem 4|2000 AMC 12, Problem 4]])</div> ...? <div style="text-align:right">([[1998 AIME Problems/Problem 8|1998 AIME, Problem 8]])</div>7 KB (1,111 words) - 14:57, 24 June 2024
- ...aginary 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=\mathrm{R *[[2007 AMC 12A Problems/Problem 18]]5 KB (860 words) - 15:36, 10 December 2023
- ...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
- ...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
- ...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
- ...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
- == Problem 1 == [[1997 AIME Problems/Problem 1|Solution]]7 KB (1,098 words) - 17:08, 25 June 2020
- {{AIME Problems|year=1998}} == Problem 1 ==7 KB (1,084 words) - 02:01, 28 November 2023
- == Problem 1 == [[1999 AIME Problems/Problem 1|Solution]]7 KB (1,094 words) - 13:39, 16 August 2020
- == Problem == The problem gives us a sequence defined by a [[recursion]], so let's calculate a few va2 KB (406 words) - 11:20, 15 February 2025
- == Problem == ...cent ordered pairs once. For example, represent (4,7),(7,3),(3,5) as <math>4,7,3,5 .</math> Label the vertices of a regular <math>n</math> -gon <math>1,9 KB (1,659 words) - 18:35, 20 June 2024
- == Problem == <cmath>p = \frac{2(m+2)(n+2)}{mn - 2n - 2m - 4} = \frac{2(m+2)(n+2)}{(m-2)(n-2) - 8}</cmath>2 KB (390 words) - 21:05, 29 May 2023
- == Problem == ...atio of the squares of the sides, so <math>\frac {(2)^{2}}{k^{2}} = \frac {4}{7 - 3\sqrt {5}} = 7 + 3\sqrt {5}</math> so <math>a^{2} + b^{2} + c^{2} = 75 KB (884 words) - 14:33, 18 June 2024
- == Problem == We can find the lengths of the sides of the polygons now. There are 4 [[right triangle]]s with legs of length 5 and 10, so their [[hypotenuse]]s7 KB (1,084 words) - 11:48, 13 August 2023
- == Problem == | 0 || 1 || 2 || 3 || 4 || 5 || 62 KB (354 words) - 13:19, 14 December 2024
- == Problem == ...3,x_4)</math> of positive odd [[integer]]s that satisfy <math>\sum_{i = 1}^4 x_i = 98.</math> Find <math>\frac n{100}.</math>5 KB (684 words) - 18:52, 19 June 2024
- == Problem == ...dd. <math>\frac {k(k-1)}2</math> will be even if <math>4|k</math> or <math>4|k-1</math>, and odd otherwise.1 KB (225 words) - 16:56, 3 February 2025
- == Problem == ...and an odd tile. Thus, since there are <math>5</math> odd tiles and <math>4</math> even tiles, the only possibility is that one player gets <math>3</ma5 KB (917 words) - 02:37, 12 December 2022
