Search results

Jump to navigation Jump to search
View ( | ) (20 | 50 | 100 | 250 | 500)
  • * 概率论(Probability Theory) # [[组合数学 (Fall 2019)/Pólya's theory of counting|Pólya's theory of counting | Pólya计数法]] ( [http://tcs.nju.edu.cn/slides/comb2019/Polya.pdf ...
    12 KB (1,290 words) - 06:43, 27 December 2019
  • The set of [[natural number]]s is '''not''' an alphabet because as it is not finite. * Michael A. Harrison, ''Introduction to Formal Language Theory'', (1978): Chapter 1.2 ...
    3 KB (400 words) - 06:51, 6 July 2016
  • In [[mathematics]], a '''Mersenne number''' is a number that is one less than a ''power of two''. ...the definition of a Mersenne number where exponent ''n'' has to be a prime number. ...
    3 KB (434 words) - 14:07, 21 July 2017
  • In [[mathematics]], a '''Ramanujan prime''' is a [[prime number]] that satisfies a result proven by [[Srinivasa Ramanujan]]. It relates to ...)'' is the [[prime counting function]]. The prime counting function is the number of primes less than or equal to ''x''. ...
    948 bytes (141 words) - 01:09, 9 March 2013
  • ...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|. ...
    590 bytes (103 words) - 01:27, 20 March 2017
  • * 概率论(Probability Theory) # [[组合数学 (Fall 2023)/Pólya's theory of counting|Pólya's theory of counting | Pólya计数法]] ([http://tcs.nju.edu.cn/slides/comb2023/Polya.pdf ...
    14 KB (1,438 words) - 18:58, 9 April 2024
  • ...ss the test, and that are not prime. These numbers are called [[Carmichael number]]s. ...the equality does not hold for a value of ''a'', then ''n'' is [[composite number|composite]] (not prime). If the equality does hold for many values of ''a' ...
    2 KB (270 words) - 22:05, 9 June 2016
  • ...ors are for values close to zero and [[hue]] encodes the value's [[complex number|argument]]. ...med after [[Bernhard Riemann]], who wrote about it in the memoir "[[On the Number of Primes Less Than a Given Quantity]]", published in 1859. ...
    3 KB (534 words) - 10:42, 20 June 2017
  • A '''Fermat number''' is a special [[positive number|positive]] [[number]]. Fermat numbers are named after [[Pierre de Fermat]]. The formula that ge ...a power of two. Every prime of the form 2<sup>''n''</sup> + 1 is a Fermat number, and such primes are called '''Fermat primes'''. The only known Fermat prim ...
    3 KB (380 words) - 16:05, 13 July 2017
  • * 概率论(Probability Theory) # [[Combinatorics (Fall 2010)/Extremal set theory|Extremal set theory]] | [http://lamda.nju.edu.cn/yinyt/notes/comb2010/comb8.pdf slides] ...
    12 KB (1,494 words) - 14:27, 3 September 2011
  • ...eory]]. He proved that the answer to his problem was smaller than Graham's number. ...ers ever used in a [[mathematical proof]]. Even if every digit in Graham's number were written in the tiniest writing possible, it would still be too big to ...
    5 KB (804 words) - 20:06, 6 April 2017
  • * 概率论(Probability Theory) # [[组合数学 (Fall 2024)/Pólya's theory of counting|Pólya's theory of counting | Pólya计数法]] ([http://tcs.nju.edu.cn/slides/comb2024/Polya.pdf ...
    10 KB (987 words) - 17:13, 14 May 2024
  • ...contributed to many areas of learning. Most of his work was about [[number theory]] and [[astronomy]]. ...her once tried to keep the children busy, telling them to add up all the [[number]]s from 1 to 100. Gauss did it quickly, like this: 1 + 100 = 101, 2 + 99 = ...
    3 KB (381 words) - 15:55, 9 March 2015
  • ...ame way that all real numbers can be thought of as 1 multiplied by another number. Arithmetic functions such as, [[addition]], subtraction, [[multiplication] ...o pose real problems for mathematicians. As a comparison, using [[negative number]]s, it is possible to find the ''x'' in the [[equation]] <math>a + x = b</m ...
    6 KB (917 words) - 00:53, 5 February 2017
  • ...82845904523536, come close to the true value. The true value of ''e'' is a number that never ends. Euler himself gave the first 23 digits of e.<ref>[[Leonhar ...onential function]]s. For example, the exponential function applied to the number one, has a value of ''e''. ...
    3 KB (351 words) - 09:48, 24 June 2017
  • ...the complex plane. The real part <math>\operatorname{Re}(s)</math> of the number is drawn horizontally, the imaginary part <math>\operatorname{Im}(s)</math> ...rom Riemann's functional equation. More have been computed and have [[real number|real]] part 1/2. The hypothesis states all the undiscovered zeros must hav ...
    2 KB (337 words) - 10:32, 20 June 2017
  • ...argument ''x'' fixed at 10. In [[number theory]], the concept of [[p-adic number]]s is also closely related to that of a power series. ...
    1 KB (213 words) - 14:55, 21 June 2017
  • ...as there is no real number that will multiply by itself to get a negative number (e.g. 3*3 = 9 and -3*-3 = 9). ...mbers is a lot like multiplying a '''positive number''' with a '''negative number'''. If I say "go east by 2*-3 miles" it means "rotate all of the way around ...
    3 KB (567 words) - 22:50, 3 February 2016
  • ...ction of two numbers can produce a negative number, which is not a natural number, but it is an integer. ...osure of [[intersection]]. Open sets have infinite closure of [[union (set theory)|union]]. That is, in mathematical notation, if A<sub>0</sub>, and A<sub>1< ...
    2 KB (271 words) - 03:33, 15 January 2015
  • Mathematics is the study of [[number]]s, [[shape]]s and [[pattern]]s. The word is sometimes shortened to '''mat === Number === ...
    9 KB (1,088 words) - 18:04, 22 August 2017
View ( | ) (20 | 50 | 100 | 250 | 500)