Search results

  • ...includes [[arithmetic]], [[algebra]], [[counting]], [[geometry]], [[number theory]], [[probability]], and [[statistics]]. The focus of MATHCOUNTS curriculum ...st 20 problems are usually the easiest in the competition, and the last 10 problems can be as hard as some of the Team Round questions. No calculators are allo
    10 KB (1,503 words) - 22:32, 4 February 2025
  • ...tions]]. Look around the AoPSWiki. Individual articles often have sample problems and solutions for many levels of problem solvers. Many also have links to Introduction To Number Theory: https://thepuzzlr.com/math-courses
    17 KB (2,329 words) - 04:01, 3 February 2025
  • ...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]
    23 KB (3,038 words) - 18:33, 15 February 2025
  • === Chaos Theory === === Introductory Textbooks ===
    10 KB (1,405 words) - 14:37, 13 January 2025
  • ...guably a branch of [[elementary algebra]], and relate slightly to [[number theory]]. They deal with [[relations]] of [[variable]]s denoted by four signs: <ma For two [[number]]s <math>a</math> and <math>b</math>:
    12 KB (1,806 words) - 05:07, 19 June 2024
  • ...Multiple Choice|difficulty=1 - 2|breakdown=<u>Problems 1 - 12</u>: 1<br><u>Problems 13 - 25</u>: 2}} ...minutes given in the exam. Problems increase in difficulty as the problem number increases. Students are not permitted calculators during the test.
    4 KB (584 words) - 18:59, 19 February 2025
  • The AMC 10 is a 25-question, 75-minute multiple-choice test. Problems generally increase in difficulty as the exam progresses. Calculators were p ...theory]], [[probability]], and other secondary school mathematical topics. Problems are designed to be solved by students without any background in calculus or
    4 KB (596 words) - 03:53, 3 February 2025
  • In [[number theory]], '''Wilson's Theorem''' states that if [[integer ]]<math>p > 1</math> , t ...<math>b-c</math>&mdash;a contradiction.) This inverse is unique, and each number is the inverse of its inverse. If one integer <math>a</math> is its own in
    4 KB (639 words) - 00:53, 2 February 2023
  • ...re than algebra problems, sometimes going into other topics such as number theory. == Fun Practice Problems ==
    4 KB (682 words) - 09:25, 18 February 2025
  • '''Number theory''' is the field of [[mathematics]] associated with studying the properties Number theory is a broad topic, and may cover many diverse subtopics, such as:
    3 KB (404 words) - 19:56, 28 December 2024
  • ...ers]]. Since modular arithmetic is such a broadly useful tool in [[number theory]], we divide its explanations into several levels: === Introductory Resources ===
    992 bytes (121 words) - 12:25, 20 December 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 If <math>a</math> is an [[integer]], <math>p</math> is a [[prime number]] and <math>a</math> is not [[divisibility|divisible]] by <math>p</math>, t
    15 KB (2,618 words) - 11:03, 19 February 2025
  • ...]]. If <math>n</math> is a positive integer, <math>\phi{(n)}</math> is the number of integers in the range <math>\{1,2,3\cdots{,n}\}</math> which are relativ ==Problems==
    4 KB (569 words) - 21:34, 30 December 2024
  • ...ntity given a name and usually denoted by a letter or symbol. Many contest problems test one's fluency with [[algebraic manipulation]]. ...a in general deals with general classes of structure. Furthermore, number theory interacts more specifically with
    3 KB (360 words) - 08:31, 21 February 2025
  • ...ed equal to <math>\frac{n(n+1)}{2}</math> (the <math>n</math>th triangular number is defined as <math>1+2+\cdots +n</math>; imagine an [[equilateral polygon ...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
    5 KB (768 words) - 23:59, 28 September 2024
  • ...impler one. And we can do this reduction again and again until the smaller number becomes <math>0</math>. ===Introductory===
    6 KB (923 words) - 16:39, 30 September 2024
  • ==Introductory Topics== ...n is the set <math>\{x:|x| \geq 3\}</math>, where <math>x</math> is a real number, because the square root is only defined when its argument is nonnegative.
    10 KB (1,761 words) - 02:16, 12 May 2023
  • ...product of powers of [[prime number]]s. An important theorem of [[number theory]] called the [[Fundamental Theorem of Arithmetic]] tells us that every [[po where <math>n</math> is any natural number, the <math>p_{i}</math> are prime numbers, and the <math>e_i</math> are the
    3 KB (496 words) - 21:14, 5 January 2024
  • {{duplicate|[[2000 AMC 12 Problems|2000 AMC 12 #1]] and [[2000 AMC 10 Problems|2000 AMC 10 #1]]}} ...If we want to make sure that this is correct, we could test with a smaller number, like <math>30</math>. It becomes much more clear that this is true, and in
    2 KB (320 words) - 18:37, 30 November 2024
  • ...quation]] relating [[integer]] (or sometimes [[natural number]] or [[whole number]]) quanitites. ...iophantine equation is closely tied to [[modular arithmetic]] and [[number theory]]. Often, when a Diophantine equation has infinitely many solutions, [[para
    9 KB (1,434 words) - 00:15, 4 July 2024

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