Search results

  • ...ce is taken into consideration if needed. Two teams were sent in 2013; the A1 team ranked 3rd nationally. Also, they got 1st nationally in the B-Division ...eams have a full 15 members but A3 may not. For example, during 2023 ARML, A3 consisted of only 3 members. When this happens we may merge with other team
    21 KB (3,500 words) - 18:41, 23 April 2024
  • pair O = (0,0), A = r*expi(pi/3), A1 = rotate(a/2)*A, A2 = rotate(-a/2)*A, A3 = rotate(-a/2-b)*A; D(O--A1--A2--cycle);
    5 KB (763 words) - 16:20, 28 September 2019
  • * [[1999 IMO Problems/Problem 2 | Problem 2 (A1)]] proposed by Marcin Kuczma, Poland * [[2000 IMO Problems/Problem 2 | Problem 2 (A1)]] proposed by Titu Andreescu, USA
    35 KB (4,009 words) - 20:25, 21 February 2024
  • .... Subtracting the equation for i=2 from that for i=1 and dividing by (a1 - a2) we get: Subtracting the equation for i=4 from that for i=3 and dividing by (a3 - a4) we get:
    944 bytes (175 words) - 12:53, 29 January 2021
  • [[2011 PuMAC Problems/Algebra Problem A1|Solution]] [[2011 PuMAC Problems/Algebra Problem A2|Solution]]
    22 KB (3,694 words) - 23:58, 3 June 2022
  • * [[2003 IMO Shortlist Problems/A1 | A1]] * [[2003 IMO Shortlist Problems/A2 | A2]]
    1 KB (156 words) - 12:39, 5 September 2012
  • * [[2008 IMO Shortlist Problems/A1 | A1]] (IMO 4) * [[2008 IMO Shortlist Problems/A2 | A2]] (IMO 2)
    1 KB (151 words) - 12:43, 5 September 2012
  • * [[2009 IMO Shortlist Problems/A1 | A1]] * [[2009 IMO Shortlist Problems/A2 | A2]]
    1 KB (171 words) - 12:47, 5 September 2012
  • * [[2010 IMO Shortlist Problems/A1 | A1]] (IMO 1) * [[2010 IMO Shortlist Problems/A2 | A2]]
    1 KB (161 words) - 12:51, 5 September 2012
  • * [[2011 IMO Shortlist Problems/A1 | A1]] (IMO 1) * [[2011 IMO Shortlist Problems/A2 | A2]]
    1 KB (171 words) - 12:53, 5 September 2012
  • pair A1 = O+1*dir(d); pair A2 = O+2*dir(d);
    1 KB (227 words) - 20:38, 2 January 2023
  • pair A1 = O+1*dir(d); pair A2 = O+2*dir(d);
    14 KB (2,035 words) - 15:23, 26 January 2024
  • pair A1=(0,0), A2=(1,0), A3=(0.5,sqrt(3)/2); D(MP("A_1",A1)--MP("A_2",A2)--MP("A_3",A3,N)--cycle);
    15 KB (2,432 words) - 01:06, 22 February 2024
  • ...ts in <math>A</math> in the way that <math>l_{a1}=3,l_{a2}=3+4\times199,l_{a3}=3+4\times398,l_{a4}=3+4\times597,l_{a5}=3+4\times796</math>, then clearly
    3 KB (522 words) - 13:54, 30 January 2021
  • Let {an} be a sequence such that a1 = 1, an+1 = an + 1. Find a18. a1 = w(e(r(e( (n(o( (s(t(r(a(n(g(e(r(s( (t(o( (l(o(v(e(42)))))))))))))))))))))
    14 KB (2,904 words) - 18:24, 16 May 2017
  • pair a1, a2, a3; a1 = b1 + c1; a2 = b2 + c2; a3 = b3 + c3;
    6 KB (1,036 words) - 00:59, 25 February 2021
  • ...,4),I1=extension(B1,A2,A1,B2),I2=extension(B1,A3,A1,B2),I3=extension(B1,A3,A2,B2); draw(B1--A1--B2);
    8 KB (1,397 words) - 09:18, 15 August 2022
  • pair O,A1,B1,C1,A2,B2,C2,A3,B3,C3,A4,B4,C4; A1=dir(x); A2=dir(x+y); A3=dir(x+2y); A4=dir(x+3y);
    16 KB (2,450 words) - 00:13, 12 November 2023
  • pair A, B, C, D, E, F, G, H, A1, B1, C1, D1, E1, F1, G1, H1, V; A1 = A+V;
    24 KB (3,567 words) - 18:14, 30 August 2022
  • ...,4),I1=extension(B1,A2,A1,B2),I2=extension(B1,A3,A1,B2),I3=extension(B1,A3,A2,B2); draw(B1--A1--B2);
    12 KB (2,025 words) - 14:56, 25 January 2024

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