Create the page "A i r" on this wiki! See also the search results found.

• 2006 AIME I Problems/Problem 10
  ...are positive integers whose [[greatest common divisor]] is 1. Find <math> a^2+b^2+c^2. </math> int i,j;
  4 KB (731 words) - 17:59, 4 January 2022
• 2006 AIME I Problems/Problem 9
  ...a_{12} = 2006, </math> find the number of possible ordered pairs <math> (a,r). </math> <cmath>\log_8 a_1+\log_8 a_2+\ldots+\log_8 a_{12}= \log_8 a+\log_8 (ar)+\ldots+\log_8 (ar^{11}) \\
  4 KB (651 words) - 18:27, 22 May 2021
• 2006 AIME I Problems/Problem 8
  ...area of rhombus <math> \mathcal{T}</math>. Given that <math> K </math> is a [[positive integer]], find the number of possible values for <math> K</math ..., D=(4.2,-3.2), EE=(0,-3.2), F=(-1.65,-1.6), G=(0.45,-1.6), H=(3.75,-1.6), I=(2.1,0), J=(2.1,-3.2), K=(2.1,-1.6);
  5 KB (730 words) - 15:05, 15 January 2024
• 2006 AIME I Problems/Problem 5
  ...n be written as <math> a\sqrt{2}+b\sqrt{3}+c\sqrt{5}, </math> where <math> a, b, </math> and <math> c </math> are [[positive]] [[integer]]s. Find <math> <cmath> a\sqrt{2}+b\sqrt{3}+c\sqrt{5} = \sqrt{104\sqrt{6}+468\sqrt{10}+144\sqrt{15}+2
  3 KB (439 words) - 18:24, 10 March 2015
• 2022 AIME I Problems/Problem 1
  .../math> and <math>Q(x)</math> cancel, we conclude that <math>R(x)</math> is a linear polynomial. R(16) &= P(16)+Q(16) &&= 54+54 &&= 108, \\
  4 KB (670 words) - 13:03, 13 November 2023
• 2021 JMC 10
  <math>\textbf{(A) } 3 \qquad\textbf{(B) } 7 \qquad\textbf{(C) } 8 \qquad\textbf{(D) } 9 \qqu <math>\textbf{(A) }\pi-e \qquad\textbf{(B) }2\pi-2e\qquad\textbf{(C) }2e\qquad\textbf{(D) }2
  12 KB (1,784 words) - 16:49, 1 April 2021
• 2000 AMC 12 Problems
  ...cdot O = 2001 </math>. What is the largest possible value of the sum <math>I + M + O</math>? <math>\textbf{(A)}\ 23 \qquad \textbf{(B)}\ 55 \qquad \textbf{(C)}\ 99 \qquad \textbf{(D)}\
  13 KB (1,948 words) - 12:26, 1 April 2022
• 2005 AMC 12B Problems
  A scout troop buys <math>1000</math> candy bars at a price of five for <math>2</math> dollars. They sell all the candy bars at t \mathrm{(A)}\ 100 \qquad
  12 KB (1,781 words) - 12:38, 14 July 2022
• Set
  ...ms, see [[Zermelo-Fraenkel Axioms]]. In this article we shall present just a brief discussion of the most common properties of sets and operations relat ...g: <math>\{1,4,5,3,24,4,4,5,6,2\}</math> Such an entity is actually called a multiset.
  11 KB (2,021 words) - 00:00, 17 July 2011
• Newman's Tauberian Theorem
  '''Newman's Tauberian Theorem''' is a [[tauberian theorem]] Let <math>f:(0,+\infty)\to\mathbb C</math> be a bounded function. Assume that
  6 KB (1,034 words) - 07:55, 12 August 2019
• 2022 USAJMO Problems/Problem 1
  ...exist integers <math>a,d,r</math> with <math>m \nmid d</math> and <math>m|a+(n-1)d-gr^{n-1}</math> for all integers <math>n>1</math>. <cmath>m | a+nd-gr^n \; (1),</cmath>
  5 KB (883 words) - 01:05, 2 June 2024
• Prime ideal
  ...I,J\subseteq R</math> with <math>IJ\subseteq P</math> we have either <math>I\subseteq P</math> or <math>J\subseteq P</math>. ...nd for any <math>a,b\in R</math> if <math>ab\in P</math> then either <math>a\in P</math> or <math>b\in P</math>.
  967 bytes (176 words) - 18:08, 7 April 2012
• 2005 AIME II Problems
  A game uses a deck of <math> n </math> different cards, where <math> n </math> is an inte ...e indistinguishable from one another. She then randomly put three rolls in a bag for each of the guests. Given that the probability each guest got one r
  7 KB (1,119 words) - 21:12, 28 February 2020
• 2005 AIME II Problems/Problem 12
  ...math> is not divisible by the [[square]] of any [[prime]], find <math> p+q+r. </math> ...D--A);draw(E--O--F);draw(G--O); dot(A^^B^^C^^D^^E^^F^^G^^O); label("\(A\)",A,(-1,1));label("\(B\)",B,(1,1));label("\(C\)",C,(1,-1));label("\(D\)",D,(-1,
  13 KB (2,080 words) - 21:20, 11 December 2022
• 2005 AIME I Problems
  {{AIME Problems|year=2005|n=I}} ...ngent to two circles adjacent to it. All circles are internally tangent to a circle <math> C </math> with radius 30. Let <math> K </math> be the area of
  6 KB (983 words) - 05:06, 20 February 2019
• 2005 AIME I Problems/Problem 1
  ...] to two circles adjacent to it. All circles are [[internally tangent]] to a circle <math> C </math> with [[radius]] 30. Let <math> K </math> be the are [[Image:2005 AIME I Problem 1.png]]
  1 KB (213 words) - 13:17, 22 July 2017
• 2005 AIME I Problems/Problem 4
  ...members left over. The director realizes that if he arranges the group in a formation with 7 more rows than columns, there are no members left over. Fi ...the number of students is <math>n(n + 7)</math> which must be 5 more than a perfect square, so <math>n \leq 14</math>. In fact, when <math>n = 14</mat
  8 KB (1,248 words) - 11:43, 16 August 2022
• 2005 AIME I Problems/Problem 6
  ...ath>1 + ir</math> and <math>1 - ir</math>. Their product is <math>P = 1 + r^2 = 1 + \sqrt{2006}</math>. <math>44^2 = 1936 < 2006 < 2025 = 45^2</math> If you think of each part of the product as a quadratic, then <math>((x-1)^2+\sqrt{2006})</math> is bound to hold the two
  4 KB (686 words) - 01:55, 5 December 2022
• 2005 AIME I Problems/Problem 9
  ...ath> and <math> c </math> are [[positive integer]]s, find <math> a+b+c+p+q+r. </math> ...}{6} = \frac{2}{3}</math> of all orientations, so from these cubes we gain a factor of <math>\left(\frac{2}{3}\right)^6</math>.
  4 KB (600 words) - 21:44, 20 November 2023
• 2005 AIME I Problems/Problem 11
  A [[semicircle]] with [[diameter]] <math> d </math> is contained in a [[square (geometry) | square]] whose sides have length 8. Given the maximum We note that aligning the base of the semicircle with a side of the square is certainly non-optimal. If the semicircle is tangent
  4 KB (707 words) - 11:11, 16 September 2021

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