Create the page "2006 USAMO Problem 2" on this wiki! See also the search results found.

Page title matches

• 2006 USAMO Problems/Problem 2
  == Problem == ...N </math> but every subset of size <math>k </math> has sum at most <math>N/2 </math>.
  2 KB (398 words) - 09:48, 5 August 2014

Page text matches

• Joining an ARML team
  *Past [[AMC]], [[AIME]], and [[USAMO]] scores ...aches select the team members during the state tournament based on [[AMC | USAMO index]], performance in local tournaments, and score at the state tournamen
  22 KB (3,532 words) - 11:25, 27 September 2024
• Induction
  ...t works for <math>n=1+1=2</math>, which in turn means it works for <math>n=2+1=3</math>, and so on. ...th>n=k+2</math>. If you wish, you can similarly induct over the powers of 2.
  5 KB (768 words) - 00:59, 29 September 2024
• Mock AMC
  ...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
• 2006 USAMO
  ...k contains the full set of test problems. The rest contain each individual problem and its solution. *[[2006 USAMO Problems]]
  467 bytes (51 words) - 09:25, 6 August 2014
• 2006 USAMO Problems
  === Problem 1 === [[2006 USAMO Problems/Problem 1 | Solution]]
  3 KB (520 words) - 09:24, 14 May 2021
• 2006 USAMO Problems/Problem 1
  == Problem == \mbox{Row 2}& s-1& 2s-1& \hdots&ks-1\
  3 KB (506 words) - 17:54, 22 June 2023
• 2006 USAMO Problems/Problem 2
  == Problem == ...N </math> but every subset of size <math>k </math> has sum at most <math>N/2 </math>.
  2 KB (398 words) - 09:48, 5 August 2014
• 2006 USAMO Problems/Problem 3
  == Problem == ...Z} \ge 0}</math> is bounded above. (In particular, this requires <math>f(n^2)\neq 0</math> for <math>n\ge 0</math>.)
  9 KB (1,699 words) - 13:48, 11 April 2020
• 2006 USAMO Problems/Problem 5
  == Problem == ...k</math> is greater than the minimum number of jumps needed to reach <math>2^i</math>.
  7 KB (1,280 words) - 17:23, 26 March 2016
• 2006 USAMO Problems/Problem 4
  == Problem == ...) Find all positive integers <math>n</math> such that there are <math>k\ge 2</math> positive rational numbers <math>a_1, a_2, \ldots, a_k</math> satisfy
  3 KB (486 words) - 22:43, 5 August 2014
• 2006 USAMO Problems/Problem 6
  == Problem == ...E/BF</math>. But we are given <math>ED/AE=CF/BF</math>, so multiplying the 2 equations together gets us <math>ED/FC=XE/XF</math>. <math>DEX,CFX</math> a
  5 KB (986 words) - 22:46, 18 May 2015
• 2005 USAMO
  ...k contains the full set of test problems. The rest contain each individual problem and its solution. *[[2005 USAMO Problems]]
  548 bytes (59 words) - 18:13, 17 September 2012
• Mock MathCounts
  ...istered to the AoPS community, while others may be sourced from a group of problem writers. Different users may have a different way of participating; some ma ...for example, you will almost surely never see <math>\text{mod}</math> on a problem statement.
  26 KB (3,260 words) - 19:28, 15 August 2024
• 2005 USAMO Problems
  == Problem 1 == [[2005 USAMO Problems/Problem 1 | Solution]]
  4 KB (609 words) - 09:24, 14 May 2021
• 2007 USAMO
  ...k contains the full set of test problems. The rest contain each individual problem and its solution. *[[2007 USAMO Problems]]
  471 bytes (52 words) - 20:59, 6 August 2014
• 2007 USAMO Problems
  ===Problem 1=== .... For instance, when <math>n=9</math> the obtained sequence is <math>9, 1, 2, 0, 3, 3, 3, \ldots</math>. Prove that for any <math>n</math> the sequence
  3 KB (539 words) - 13:42, 4 July 2013
• 2007 USAMO Problems/Problem 4
  == Problem == <div style="text-align:center;">[[Image:2007 USAMO-4.PNG|350px]]</div>
  10 KB (1,871 words) - 18:44, 24 February 2025
• 2006 IMO Problems/Problem 5
  == Problem == '''Lemma 1.''' The problem statement holds for <math>k=2</math>.
  3 KB (704 words) - 14:42, 7 September 2021
• Daniel Zhou's Profile
  # [https://artofproblemsolving.com/community/u530868h596930p27818958 2014 IMO Problem 1] ...ttps://artofproblemsolving.com/community/u530868h1181533p28126160 2013 IMO Problem 4]
  7 KB (808 words) - 00:26, 4 February 2025
• Know the Facts: Gmaas
  ...Apparently, Leibniz had Gmaas_number 1 while Schrodinger had Gmaas_number 2, where a lower Gmaas number indicates a higher power. (When Gmaas found out - 2006: Debate on whether to rename Gmaathamatics Gmaasology or Gmaas Studies. Gma
  89 KB (15,007 words) - 15:02, 19 February 2025

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