Search results
Create the page "2004 AIME I Problem 10" on this wiki! See also the search results found.
Page title matches
- == Problem == [[Image:2004_I_AIME-10.png]]5 KB (836 words) - 07:53, 15 October 2023
Page text matches
- An example of a classic problem is as follows: ...a coincidence that 67 is close to two-thirds of 100! We can approach this problem in a constructive way, building the set based on the remainders when divide4 KB (635 words) - 12:19, 2 January 2022
- ...es for each digit to arrive at our answer: <math>9 \cdot 10 \cdot 10 \cdot 10 = 9000</math>. <math>\square</math> This is a problem where constructive counting is not the simplest way to proceed. This next e13 KB (2,018 words) - 15:31, 10 January 2025
- ...iv style="text-align:right">([[2000 AMC 12 Problems/Problem 4|2000 AMC 12, Problem 4]])</div> ...a triangle. <div style="text-align:right">(Manhattan Mathematical Olympiad 2004)</div>7 KB (1,111 words) - 14:57, 24 June 2024
- ...ver, it is possible to define a number, <math> i </math>, such that <math> i = \sqrt{-1} </math>. If we add this new number to the reals, we will have ...rm <math> a + bi </math> where <math> a,b\in \mathbb{R} </math> and <math> i = \sqrt{-1} </math> is the [[imaginary unit]]. The set of complex numbers i5 KB (860 words) - 15:36, 10 December 2023
- * [[2005_AMC_10A_Problems/Problem_17 | 2005 AMC 10A Problem 17]] * [[2006_AMC_10A_Problems/Problem_19 | 2006 AMC 10A Problem 19]]4 KB (736 words) - 02:00, 7 March 2024
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2004 AIME I Problems]]1 KB (135 words) - 18:15, 19 April 2021
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2004 AIME II Problems]]1 KB (135 words) - 12:24, 22 March 2011
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2005 AIME I Problems]]1 KB (154 words) - 12:30, 22 March 2011
- ...A number of '''Mock AMC''' competitions have been hosted on the [[Art of Problem Solving]] message boards. They are generally made by one community member ...amous theorems and formulas and see if there's any way you can make a good problem out of them.51 KB (6,175 words) - 21:41, 27 November 2024
- {{AIME Problems|year=2005|n=I}} == Problem 1 ==6 KB (983 words) - 05:06, 20 February 2019
- == Problem == ...</math>. For example, <math> S_3 </math> is the [[sequence]] <math> 1,4,7,10,\ldots. </math> For how many values of <math> k </math> does <math> S_k </m2 KB (303 words) - 01:31, 5 December 2022
- == Problem == ...ases}1 & \text{if }x = 1\ \frac x{10} & \text{if }x\text{ is divisible by 10}\ x+1 & \text{otherwise}\end{cases}9 KB (1,491 words) - 01:23, 26 December 2022
- == Problem == import three; defaultpen(fontsize(10)+linewidth(0.62));4 KB (729 words) - 01:00, 27 November 2022
- == Problem == {{AIME box|year=2004|n=I|num-b=10|num-a=12}}5 KB (839 words) - 22:12, 16 December 2015
- == Problem == [[Image:2004_I_AIME-10.png]]5 KB (836 words) - 07:53, 15 October 2023
- == Problem == {{AIME box|year=2004|n=I|num-b=8|num-a=10}}4 KB (647 words) - 17:43, 23 November 2024
- == Problem == ...ine{( n+1)}}\,{\underline {(n)}} </math><math>= 1000(n + 3) + 100(n + 2) + 10(n + 1) + n = 3210 + 1111n</math>, for <math>n \in \lbrace0, 1, 2, 3, 4, 5,2 KB (250 words) - 23:56, 2 December 2024
- == Problem == Alpha and Beta both took part in a two-day problem-solving competition. At the end of the second day, each had attempted quest3 KB (436 words) - 18:31, 9 January 2024
- == Problem == ...</math> is [[odd integer | odd]] and <math> a_i>a_{i+1} </math> if <math> i </math> is [[even integer | even]]. How many snakelike integers between 1003 KB (562 words) - 18:12, 4 March 2022
- == Problem == ...um of the product of each pair of distinct terms, or <math>C = \sum_{1 \le i \neq j}^{15} S_iS_j</math>. Also, we know that7 KB (1,099 words) - 13:41, 30 December 2024
