Search results

  • ...combinatorics, and number theory, along with sets of accompanying practice problems at the end of every section. ...88606&sprefix=after+school+maths+%2Caps%2C268&sr=8-2 100 Challenging Maths Problems]
    24 KB (3,202 words) - 14:33, 13 January 2025
  • ...correct answers receive one point of credit, making the maximum score 15. Problems generally increase in difficulty as the exam progresses - the first few que ...ber theory]], and [[probability]] and other secondary school math topics. Problems usually require either very creative use of secondary school curriculum, or
    8 KB (1,062 words) - 18:04, 17 January 2025
  • In [[combinatorics]], the '''pigeonhole principle''' states that if <math>n+1</math> or more p == Introductory Examples ==
    11 KB (1,986 words) - 18:13, 19 June 2024
  • ...as a great introductory video to combinations, permutations, and counting problems in general! [https://bit.ly/CombinationsAndPermutations Permutations & Comb * [[Combinatorics]]
    4 KB (638 words) - 20:55, 5 January 2025
  • The '''factorial''' is an important function in [[combinatorics]] and [[analysis]], used to determine the number of ways to arrange objects ==Problems==
    10 KB (809 words) - 15:40, 17 March 2024
  • ...ponents in [[modular arithmetic]] (which students should study more at the introductory level if they have a hard time following the rest of this article). This th In contest problems, Fermat's Little Theorem is often used in conjunction with the [[Chinese Re
    16 KB (2,660 words) - 22:42, 28 August 2024
  • == Introductory Probability == ...following topics, a student learning about probability should learn about introductory [[counting]] techniques.
    4 KB (590 words) - 10:52, 28 September 2024
  • ...ptible to induction solutions, but that's not to say that there aren't any problems in other areas, such as [[Inequalities]], that can be solved with induction ...eful in any level of mathematics that has an emphasis on proof. Induction problems can be found anywhere from the Power Round of the [[American Regions Math L
    5 KB (768 words) - 23:59, 28 September 2024
  • ...action or division. The idea of strategic overcounting is fundamental to [[combinatorics]] and plays a role in incredibly important counting tools such as [[combina * [[2004 AIME I Problems/Problem 3|AIME 2004I/3]]
    4 KB (635 words) - 11:19, 2 January 2022
  • In [[combinatorics]], '''constructive counting''' is a [[counting]] technique that involves co ...niques in counting. Familiarity with constructive counting is essential in combinatorics, especially in intermediate competitions.
    13 KB (2,018 words) - 14:31, 10 January 2025
  • ==Problems== === Introductory ===
    7 KB (1,111 words) - 13:57, 24 June 2024
  • ...as a great introductory video to combinations, permutations, and counting problems in general! [https://bit.ly/CombinationsAndPermutations Permutations & Comb * [[Combinatorics]]
    3 KB (422 words) - 10:01, 25 December 2020
  • [[Category:Introductory Combinatorics Problems]]
    1 KB (213 words) - 14:33, 9 April 2024
  • {{duplicate|[[2006 AMC 12A Problems|2006 AMC 12A #20]] and [[2006 AMC 10A Problems/Problem 25|2006 AMC 10A #25]]}} 2006 AMC 12A Problems/Problem 20 (section) this solution is extremely good and very hard to learn
    6 KB (1,083 words) - 13:05, 25 November 2024
  • * [[2006 AMC 12A Problems]] [[Category:Introductory Algebra Problems]]
    8 KB (1,332 words) - 16:37, 17 September 2023
  • [[Category:Introductory Combinatorics Problems]]
    1 KB (207 words) - 08:39, 25 July 2023
  • [[Category:Introductory Combinatorics Problems]]
    2 KB (252 words) - 14:33, 30 July 2024
  • [[Category:Introductory Combinatorics Problems]]
    3 KB (525 words) - 19:25, 30 April 2024
  • [[Category:Introductory Combinatorics Problems, Introductory Algebra Problems]]
    1 KB (239 words) - 10:54, 31 July 2023
  • [[Category:Introductory Combinatorics Problems]]
    5 KB (831 words) - 17:47, 29 January 2025

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