Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...ree [[field extension]] of the field <math>\mathbb{Q}</math> of [[Rational number|rational numbers]]. ...rs, is the central topic of [[:en:Algebraic_number_theory|algebraic number theory]]. ...
    374 bytes (55 words) - 16:13, 15 September 2021
  • ...hat neither this hypothesis nor its negation contradicts the tenets of set theory itself.<ref>{{Cite web|last=Weisstein|first=Eric W.|title=Continuum|url=htt * [[Continuum (theory)]] ...
    1 KB (163 words) - 20:46, 10 August 2023
  • {{Groups}}In [[group theory]], a branch of [[mathematics]], given a group <math>G</math> under a [[bina For example, the [[even number]]s are a subgroup of the [[integer]]s, with [[addition]] as the binary oper ...
    597 bytes (103 words) - 18:10, 15 June 2024
  • ...e number|prime]]s. It says that if ''a'' is a number, and ''p'' is a prime number, then in the notation of modular Arithmetic, it can be expressed as, [[Category:Theorems in number theory]] ...
    544 bytes (96 words) - 10:25, 21 February 2022
  • ...' be any [[natural number]]. Wilson's theorem says that ''n'' is a [[prime number]] if and only if: ...uation is correct. Also, if the equation is correct, then ''n'' is a prime number. The equation says that the [[factorial]] of ''(n - 1)'' is one less than a ...
    488 bytes (84 words) - 10:25, 21 February 2022
  • ...'''Cantor's paradox''' refers to two related [[paradox]]es in [[naive set theory]]: * The set of all [[cardinal number]]s does not exist. ...
    2 KB (285 words) - 19:44, 20 March 2025
  • ...any elements are in H, called the order of H) divides |G|. Moreover, the number of distinct left (right) [[coset]]s of H in G is |G|/|H|. This theorem is [[Category:Group theory]] ...
    671 bytes (112 words) - 23:46, 5 July 2023
  • In [[graph theory]], a '''directed graph''' (or '''digraph''') is a [[Graph (mathematics)|gra For a normal graph, the degree of a vertex <math>v</math> is the number of edges touching <math>v</math>. ...
    823 bytes (138 words) - 19:50, 22 July 2022
  • In [[number theory]] a '''Carmichael number''' is a [[composite number|composite]] positive [[integer]] <math>n</math>, which satisfies the [[cong ...are composite numbers that behave a little bit like they would be a prime number. ...
    1 KB (163 words) - 20:52, 10 June 2022
  • ...t Theory Symbols|url=https://mathvault.ca/hub/higher-math/math-symbols/set-theory-symbols/|access-date=2020-10-07|website=Math Vault|language=en-US}}</ref> * [[Cardinal number]] ...
    1 KB (135 words) - 19:13, 7 October 2020
  • ...F, the system is called '''ZFC'''. It is the system of axioms used in set theory by most [[mathematician]]s today. ...t did not have contradictions. [[Ernst Zermelo]] proposed a theory of set theory in 1908. In 1922, [[Abraham Fraenkel]] proposed a new version based on Zer ...
    4 KB (713 words) - 01:24, 21 December 2024
  • ...t theory]] (particularly in the theory of [[Infinity|infinite]] [[Cardinal number|cardinal numbers]]), the <math>\gimel</math> symbol is used to represent th ...
    1 KB (135 words) - 19:39, 7 October 2020
  • ...'') states that if ''n'' and ''a'' are [[coprime]], (meaning that the only number that divides ''n'' and ''a'' is 1), then the following [[equivalence relati [[Category:Theorems in number theory]] ...
    1 KB (180 words) - 16:55, 14 August 2024
  • [[Category:Number theory]] ...
    325 bytes (45 words) - 14:35, 28 August 2023
  • [[Category:Number theory]] ...
    257 bytes (38 words) - 05:34, 25 January 2022
  • ...e '''totient''' of a [[positive number|positive]] [[integer]] ''n'' is the number of positive integers smaller than ''n'' which are [[coprime]] to ''n'' (the ...}/n\mathbb{Z}</math>. This fact, together with [[Lagrange's theorem (group theory)|Lagrange's theorem]], provides a proof for [[Euler's theorem]]. ...
    2 KB (375 words) - 16:55, 14 August 2024
  • A [[real number|real]] or [[complex number]] is called a '''transcendental number''' if it cannot be found as a result of an algebraic equation with [[intege ...ental can be very hard. Each transcendental number is also an [[irrational number]]. The first people to see that there were transcendental numbers were [[Go ...
    2 KB (225 words) - 17:20, 26 May 2022
  • '''Ordinal numbers''' (or '''ordinals''') are [[number]]s that show something's [[order]], for example: 1st, 2nd, 3rd, 4th, 5th. ...ega</math> + 1).<ref>{{Cite web|last=Weisstein|first=Eric W.|title=Ordinal Number|url=https://mathworld.wolfram.com/OrdinalNumber.html#:~:text=In%20formal%20 ...
    2 KB (358 words) - 05:31, 27 October 2024
  • [[Category:Number theory]] ...
    548 bytes (64 words) - 19:14, 2 December 2024
  • ...number''' is a [[Mathematical model|mathematical method]] to obtain from a number another written in the opposite way to the first. ...st2=Barry|date=2021|title=Numbers and properties|journal=Journal of Number Theory}}</ref> ...
    1 KB (205 words) - 15:34, 10 October 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)