Search results
Create the page "Problem 18" on this wiki! See also the search results found.
Page title matches
- == Problem ==2 KB (354 words) - 15:57, 28 December 2020
- == Problem == ...by the commutative property(this is the same as the equation given in the problem. We are just rearranging). So we can set <math>\frac{1}{x} = x</math> which2 KB (334 words) - 17:34, 18 September 2020
- == Problem ==2 KB (262 words) - 20:20, 21 December 2020
- == Problem ==2 KB (252 words) - 14:33, 30 July 2024
- == Problem ==1 KB (158 words) - 00:33, 29 May 2023
- == Problem ==1 KB (195 words) - 14:33, 16 December 2021
- == Problem == ...y of South Carolina High School Math Contest/1993 Exam/Problem 17|Previous Problem]]2 KB (331 words) - 23:37, 25 January 2023
- ==Problem== The original final problem was poorly worded, since the problem directly stated that the answer is <math>\boxed{1/2}</math>.2 KB (348 words) - 09:34, 23 July 2024
- == Problem == The problem is asking for <math>\frac{1}{a}+\frac{1}{b}= \frac{a+b}{ab}</math>3 KB (458 words) - 12:41, 26 August 2023
- == Problem ==3 KB (426 words) - 17:20, 18 July 2022
- == Problem ==2 KB (319 words) - 23:37, 24 March 2024
- == Problem ==2 KB (277 words) - 17:15, 25 November 2020
- ...ate|[[2004 AMC 12A Problems|2004 AMC 12A #18]] and [[2004 AMC 10A Problems/Problem 22|2004 AMC 10A #22]]}} == Problem ==5 KB (811 words) - 14:30, 27 June 2024
- {{duplicate|[[2000 AMC 12 Problems|2000 AMC 12 #18]] and [[2000 AMC 10 Problems|2000 AMC 10 #25]]}} == Problem ==2 KB (409 words) - 06:46, 24 August 2024
- == Problem ==2 KB (264 words) - 12:49, 8 June 2024
- ==Problem== ...alternate way is by seeing that the set-up AHGCM is similar to the 2 pole problem (http://www.artofproblemsolving.com/wiki/index.php/1951_AHSME_Problems/Prob6 KB (867 words) - 23:17, 19 May 2023
- ==Problem==2 KB (302 words) - 03:51, 16 January 2023
- ==Problem== ...}\ 10 \qquad \mathrm{(B)}\ 13 \qquad \mathrm{(C)}\ 16 \qquad \mathrm{(D)}\ 18 \qquad \mathrm{(E)}\ 21</math>5 KB (759 words) - 01:38, 2 November 2024
- ==Problem== You can solve this problem by setting up a simple equation with the Pythagorean Theorem. The hypotenus2 KB (385 words) - 13:17, 4 June 2021
- ==Problem==880 bytes (141 words) - 18:39, 3 November 2024
Page text matches
- == Problem == draw((0,0)--(18,0));2 KB (307 words) - 23:58, 17 November 2024
- == Problem == ...[[User:Integralarefun|Integralarefun]] ([[User talk:Integralarefun|talk]]) 18:19, 27 September 2023 (EDT)2 KB (268 words) - 17:19, 27 September 2023
- == Problem == ...in area. They also have the same altitude. If the base of the triangle is 18 inches, the median of the trapezoid is:878 bytes (143 words) - 19:56, 1 April 2017
- *Two different [[prime number]]s between <math>4</math> and <math>18</math> are chosen. When their sum is subtracted from their product, which o ([[2000 AMC 12/Problem 6|Source]])4 KB (682 words) - 12:13, 8 December 2024
- ...at <math>n>k</math>. The definition that <math>|N| > |K|</math> (as in our problem) is that there exists a surjective mapping from <math>N</math> to <math>K</ ...select a fifth sock without creating a pair. We may use this to prove the problem:11 KB (1,986 words) - 18:13, 19 June 2024
- ...d only once. In particular, memorizing a formula for PIE is a bad idea for problem solving. ==== Problem ====9 KB (1,703 words) - 00:20, 7 December 2024
- * <math>18! = 6402373705728000</math> ([[2007 iTest Problems/Problem 6|Source]])10 KB (809 words) - 15:40, 17 March 2024
- ...hat is the units digit of <math>k^2 + 2^k</math>? ([[2008 AMC 12A Problems/Problem 15]]) ...27^5=n^5</math>. Find the value of <math>{n}</math>. ([[1989 AIME Problems/Problem 9|1989 AIME, #9]])<br><br>16 KB (2,660 words) - 22:42, 28 August 2024
- Other, odder inductions are possible. If a problem asks you to prove something for all integers greater than 3, you can use <m ...ernational Mathematics Olympiad | IMO]]. A good example of an upper-level problem that can be solved with induction is [http://www.artofproblemsolving.com/Fo5 KB (768 words) - 23:59, 28 September 2024
- ([[2006 AMC 12A Problems/Problem 16|Source]]) ([[2006 AMC 12A Problems/Problem 21|Source]])9 KB (1,510 words) - 18:56, 16 January 2025
- *[[2007 AMC 12A Problems/Problem 18]] *[[1984 AIME Problems/Problem 8|1984 AIME Problem 8]]5 KB (860 words) - 14:36, 10 December 2023
- * [[2017_USAJMO_Problems/Problem_3 | 2017 USAJMO Problem 3]] * [[2016_AMC_12A_Problems/Problem_17 | 2016 AMC 12A Problem 17]] (See Solution 2)2 KB (318 words) - 22:35, 13 September 2024
- ==Problem== ...and in this situation, the value of <math>I + M + O</math> would be <math>18</math>. Now, we use this process on <math>2001</math> to get <math>667 * 32 KB (320 words) - 18:37, 30 November 2024
- ...ns can significantly help in solving functional identities. Consider this problem: === Problem Examples ===4 KB (743 words) - 23:28, 17 November 2024
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AMC 10B Problems/Problem 1]]2 KB (182 words) - 20:57, 23 January 2021
- ...contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AMC 12B Problems/Problem 1 | Problem 1]]2 KB (210 words) - 23:06, 6 October 2014
- * <math>91 \not\equiv 18 \pmod{6}</math> because <math>\frac{91 - 18}{6} = \frac{73}{6}</math>, which is not an integer. === Sample Problem ===16 KB (2,410 words) - 13:05, 3 January 2025
- ...ngruence: <math>x \equiv 5 \pmod{21}</math>, and <math>x \equiv -3 \equiv 18 \pmod{21}</math>. (Note that two values of <math>x</math> that are congrue ...following topics expand on the flexible nature of modular arithmetic as a problem solving tool:14 KB (2,317 words) - 18:01, 29 October 2021
- ...k contains the full set of test problems. The rest contain each individual problem and its solution. * [[2006 AMC 10A Problems/Problem 1]]2 KB (180 words) - 17:06, 6 October 2014
- == Problem 1 == ...<math> \overline{AC} </math> is perpendicular to <math> \overline{CD}, AB=18, BC=21, </math> and <math> CD=14. </math> Find the perimeter of <math> ABCD7 KB (1,173 words) - 02:31, 4 January 2023