Search results
Create the page "Theorem" on this wiki! See also the search results found.
Page title matches
- ==Theorem== (Weierstrass factorization theorem) Let $f \colon \mathbb{C} \rightarrow \mathbb{C}$ be [[entire]] and let $\{923 bytes (136 words) - 19:12, 26 November 2016
- ==Theorem== [[Category:Theorem]]296 bytes (39 words) - 20:25, 27 June 2016
- ==Theorem== [[Category:Theorem]]300 bytes (37 words) - 08:09, 8 June 2016
- ==Theorem== [[Category:Theorem]]217 bytes (29 words) - 00:49, 1 October 2016
- ==Theorem== [[Category:Theorem]]2 KB (333 words) - 18:09, 25 September 2016
Page text matches
- [[Rolle's theorem]]<br />26 KB (2,938 words) - 15:47, 26 August 2023
- <strong>Theorem: (The ratio test)</strong> Let $\{a_1,a_2,\ldots\} \subset \mathbb{C}$ and666 bytes (93 words) - 18:38, 1 December 2015
- ==Theorem== [[Category:Theorem]]320 bytes (42 words) - 08:03, 8 June 2016
- ==Theorem== ==Theorem==277 bytes (38 words) - 19:42, 10 December 2016
- ==Theorem== [[Category:Theorem]]532 bytes (68 words) - 03:09, 1 July 2017
- <strong>Theorem:</strong> Define $y(t)={}_pF_q(\vec{a};\vec{b};t)$. Then $y$ satisfies3 KB (506 words) - 21:30, 26 June 2016
- <strong>Theorem:</strong> We can write <strong>Theorem:</strong> The function $H$ is an [[entire function]].2 KB (267 words) - 18:28, 24 May 2016
- ==Theorem== [[Category:Theorem]]725 bytes (104 words) - 22:57, 24 June 2016
- ==Theorem== [[Category:Theorem]]364 bytes (47 words) - 07:55, 8 June 2016
- <strong>Theorem:</strong> The difference equation of hypergeometric type can be written in862 bytes (126 words) - 08:58, 17 January 2015
- ==Theorem== [[Category:Theorem]]634 bytes (84 words) - 03:31, 17 March 2018
- ==Theorem== [[Category:Theorem]]318 bytes (44 words) - 12:40, 17 September 2016
- ==Theorem== [[Category:Theorem]]853 bytes (120 words) - 08:33, 18 December 2016
- ==Theorem== [[Category:Theorem]]1 KB (223 words) - 21:04, 3 March 2018
- ==Theorem== [[Category:Theorem]]422 bytes (57 words) - 15:10, 6 October 2016
- ==Theorem== (Weierstrass factorization theorem) Let $f \colon \mathbb{C} \rightarrow \mathbb{C}$ be [[entire]] and let $\{923 bytes (136 words) - 19:12, 26 November 2016
- It was shown that if $B$ exists, then the prime number theorem follows from it. Legendre himself guessed $B$ to be around $1.08366$, but C615 bytes (88 words) - 18:59, 24 May 2016
- ::3. The Factorisation Theorem ::2. The Factorisation Theorem4 KB (409 words) - 20:56, 27 June 2016
- <strong>Theorem:</strong> The Charlier polynomials are [[orthogonal polynomials]] with resp801 bytes (111 words) - 17:34, 24 June 2016
- [[Bohr-Mollerup theorem]]<br />5 KB (678 words) - 18:12, 16 June 2018
- <strong>Theorem ($q$-Bohr-Mollerup):</strong> Let $f$ be a function which satisfies <strong>Theorem (Legendre Duplication Formula):</strong> $\Gamma_q(2x)\Gamma_{q^2}\left(\df2 KB (252 words) - 00:13, 30 May 2017
- <strong>Theorem:</strong> The following formula holds:2 KB (271 words) - 00:43, 25 June 2017
- =Theorem/proof box template= Each theorem should have its own page. Each theorem page should be formatted in the following way:8 KB (1,248 words) - 04:48, 26 November 2016
- <strong>Theorem:</strong> For $|x|<1,|q|<1$,1 KB (203 words) - 18:56, 24 May 2016
- ==Theorem== [[Category:Theorem]]1 KB (172 words) - 20:40, 26 June 2016
- ==Theorem== [[Category:Theorem]]581 bytes (80 words) - 20:41, 26 June 2016
- [http://arxiv.org/pdf/math/0202159v1.pdf An Elementary Proof of of Apéry's Theorem]682 bytes (105 words) - 17:17, 24 June 2016
- [[Prime number theorem, pi and x/log(x)]]<br /> [[Prime number theorem, logarithmic integral]]<br />600 bytes (82 words) - 06:35, 22 June 2016
- <strong>Theorem:</strong> The Hermite polynomials $H_n$ satisfy the [[Rodrigues' formula]] <strong>Theorem:</strong> ([[Generating function]]) The Hermite polynomials obey2 KB (228 words) - 18:41, 24 May 2016
- ::::7.6.1. Gegenbauer's addition theorem ::::7.6.2. Graf's addition theorem5 KB (521 words) - 05:44, 4 March 2018
- ::A proof of Kronecker's theorem1 KB (170 words) - 15:23, 18 March 2017
- [https://www.youtube.com/watch?v=4hu6Z8ZCl5Q Euler Totient Theorem, Fermat Little Theorems] (19 December 2011)<br /> ...e.com/watch?v=9Pox0bIgC8g Euler's Totient Theorem: What is Euler's Totient Theorem and Why is it useful?] (6 July 2014)<br />2 KB (344 words) - 01:58, 21 December 2017
- <strong>Theorem:</strong> For every $n \geq 1$ <strong>Theorem:</strong> The following formula holds:1 KB (139 words) - 06:35, 22 June 2016
- ==Theorem== [[Category:Theorem]]519 bytes (75 words) - 01:05, 4 March 2018
- ==Theorem== [[Category:Theorem]]245 bytes (33 words) - 01:29, 20 December 2017
- ==Theorem== [[Category:Theorem]]260 bytes (35 words) - 01:28, 20 December 2017
- ==Theorem== [[Category:Theorem]]261 bytes (35 words) - 01:26, 20 December 2017
- ==Theorem== [[Category:Theorem]]243 bytes (32 words) - 23:48, 19 December 2017
- ==Theorem== [[Category:Theorem]]259 bytes (36 words) - 23:47, 19 December 2017
- [[Prime number theorem, logarithmic integral]]<br />994 bytes (117 words) - 03:33, 17 March 2018
- <strong>Theorem:</strong> The following formula holds:754 bytes (117 words) - 01:05, 4 March 2018
- <strong>Theorem:</strong> (Orthogonality) Let $w(x)=e^{-x^2}$, then <strong>Theorem:</strong> The following formula holds:2 KB (256 words) - 00:49, 9 July 2016
- [[Prime number theorem, pi and x/log(x)|The prime number theorem]]<br />3 KB (452 words) - 05:03, 21 December 2017
- ==Theorem== [[Category:Theorem]]1 KB (206 words) - 03:19, 1 July 2017
- ==Theorem== [[Category:Theorem]]1,007 bytes (152 words) - 01:27, 1 July 2017
- ==Theorem== [[Category:Theorem]]1 KB (201 words) - 03:18, 1 July 2017
- ==Theorem== [[Category:Theorem]]870 bytes (124 words) - 00:35, 26 April 2017
- ==Theorem== [[Category:Theorem]]740 bytes (106 words) - 02:48, 5 January 2017
- ==Theorem== [[Category:Theorem]]755 bytes (109 words) - 00:34, 26 April 2017
- ==Theorem== [[Category:Theorem]]963 bytes (147 words) - 01:29, 1 July 2017