Create the page "A L E N" on this wiki! See also the search results found.

• 2001 AIME II Problems/Problem 15
  ...<math>p</math> is not divisible by the square of any prime. Find <math>m + n + p</math>. ...ection = orthographic(camera=(1/4,2,3/4)); defaultpen(linewidth(0.7)); pen l = linewidth(0.5) + linetype("10 2");
  4 KB (518 words) - 15:01, 31 December 2021
• University of South Carolina High School Math Contest/1993 Exam/Problems
  If the width of a particular rectangle is doubled and the length is increased by 3, then the ...B) \ } 2 \qquad \mathrm{(C) \ } 3 \qquad \mathrm{(D) \ } 6 \qquad \mathrm{(E) \ } 9 </cmath>
  14 KB (2,102 words) - 22:03, 26 October 2018
• Mock AIME 1 2006-2007/Problems
  ...th> and <math>n</math> are relatively prime positive intgers, find <math>m+n</math>. (Note that <math>[ABC]</math> denotes the area of <math>\triangle A ...>\mathcal{S}</math>, we have that <math>\star (n)=12</math> and <math>0\le n< 10^{7}</math>. If <math>m</math> is the number of elements in <math>\mathc
  8 KB (1,355 words) - 14:54, 21 August 2020
• P versus NP
  .... <math>NP</math> is the class of decision problems that can be solved by a ''non-deterministic'' algorithm in polynomial time. The <math>P</math> ver Since all modern computers (with the exception of a few quantum computers) are deterministic, non-deterministic algorithms are
  6 KB (1,104 words) - 15:11, 25 October 2017
• 2005 AMC 10A Problems/Problem 13
  How many positive integers <math>n</math> satisfy the following condition: <math> (130n)^{50} > n^{100} > 2^{200}\ ?</math>
  2 KB (223 words) - 07:18, 16 July 2022
• 2005 AMC 10A Problems/Problem 25
  ...h> BC = 39</math>, and <math>AC=42</math>. Points <math>D</math> and <math>E</math> are on <math>AB</math> and <math>AC</math> respectively, with <math> ...\textbf{(C) }\frac{1}{3}\qquad \textbf{(D) } \frac{19}{56}\qquad \textbf{(E) } 1 </math>
  6 KB (854 words) - 20:25, 24 July 2022
• 2007 iTest Problems
  A twin prime pair is a set of two primes <math>(p, q)</math> such that <math>q</math> is <math>2</ <math>\mathrm{(A)}\, 4</math>
  30 KB (4,794 words) - 23:00, 8 May 2024
• Euler line
  ...] <math>L</math>. It is named after [[Leonhard Euler]]. Its existence is a non-trivial fact of Euclidean [[geometry]]. Certain fixed orders and distan ...ath>, and <math>\triangle CH_AH_B</math> [[concurrence | concur]] at <math>N</math>, the nine-point circle of <math>\triangle ABC</math>.
  59 KB (10,203 words) - 04:47, 30 August 2023
• 2006 Seniors Pancyprian/2nd grade/Problem 4
  ...ibed in a circle, its sides <math>DA</math>, <math>CB</math> meet at <math>E</math> and its sides <math>BA</math>, <math>CD</math> meet at <math>Z</math ...th> intersect the sides of the quadrilateral at the points <math>K , L, M ,N</math> prove that
  856 bytes (129 words) - 00:10, 20 February 2020
• 2020 AMC 10A Problems
  {{AMC10 Problems|year=2020|ab=A}} ...uad\textbf{(C)}\ \frac{7}{12}\qquad\textbf{(D)}\ \frac{2}{3}\qquad\textbf{(E)}\ \frac{5}{6}</math>
  13 KB (1,968 words) - 18:32, 29 February 2024
• Asymptote: Reference
  A '''point''' is associated with a cartesian coordinate pair in Asymptote. There are two useful functions tha returns the complex number <math>e^{i\theta}</math>, i.e. (cos(theta),sin(theta)) where theta is measured in radians.
  7 KB (1,205 words) - 21:38, 26 March 2024
• Mock AIME 1 Pre 2005 Problems
  ...<math>n</math> are relatively prime positive integers. Determine <math>m + n</math>. <math>A, B, C, D,</math> and <math>E</math> are collinear in that order such that <math>AB = BC = 1, CD = 2,</ma
  6 KB (1,100 words) - 22:35, 9 January 2016
• Mock AIME 3 Pre 2005 Problems
  ...igits are in increasing order. Determine the remainder obtained when <math>N</math> is divided by <math>1000</math>. (Repeated digits are allowed.) A function <math>f(x)</math> is defined for all real numbers <math>x</math>.
  7 KB (1,135 words) - 23:53, 24 March 2019
• 2007 AIME I Problems/Problem 10
  ...the number of shadings with this property. Find the remainder when <math>N</math> is divided by 1000. ...nother row that is complementary to the first. We remove those two and use a similar argument again to show that every group of <math>6</math> rows can
  13 KB (2,328 words) - 00:12, 29 November 2023
• 2007 Cyprus MO/Lyceum/Problem 22
  ...apezium with <math>\angle A= \angle D=90^\circ</math> and bases <math>AB = a</math> , <math>DC = 2a</math> . If <math>AD = 3a</math> and <math>M</math> ...\ } \frac{5a}{2}\qquad \mathrm{(D) \ } \frac{3a}{\sqrt{3}}\qquad \mathrm{(E) \ } 2a</math>
  979 bytes (166 words) - 02:33, 19 January 2024
• Pascal's Theorem
  pair A=dir(20), B=dir(40), E=dir(210),F=dir(300);
  4 KB (712 words) - 21:57, 25 April 2020
• Circumradius
  ...very triangle is [[cyclic]], every triangle has a circumscribed circle, or a [[circumcircle]]. ==Formula for a Triangle==
  4 KB (729 words) - 16:52, 19 February 2024
• 1998 PMWC Problems
  int triangle(pair z, int n){ for(int i = 0; i < n; ++i){
  11 KB (1,738 words) - 19:25, 10 March 2015
• 2000 PMWC Problems
  <math>y</math> is a number that has <math>8</math> different factors (including the number <mat Given that <math>A^4=75600\times B</math>. If <math>A</math> and <math>B</math> are positive integers, find the smallest value of
  11 KB (1,713 words) - 22:47, 13 July 2023
• Excircle
  ...is a [[circle]] [[Tangent line|tangent]] to the extensions of two sides of a [[triangle]] and the third side. pair excenter(pair A, pair B, pair C){
  5 KB (843 words) - 03:02, 1 July 2020

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