Search results
Create the page "Definition" on this wiki! See also the search results found.
Page title matches
- #REDIRECT [[Derivative/Definition]]35 bytes (3 words) - 09:51, 20 February 2016
- #REDIRECT [[Derivative/Definition]]35 bytes (3 words) - 18:26, 3 March 2010
- 5 KB (994 words) - 15:21, 3 January 2012
- = What is the definition of Pure Mathematics? = ...using numbers and symbols''. This is, however, not fully true because this definition also uses applied mathematics. We want ''pure mathematics''.35 KB (5,884 words) - 09:25, 7 December 2024
Page text matches
- The value, by definition, is <cmath>\begin{align*}2 KB (257 words) - 09:57, 16 June 2023
- ...lculus Honors Calculus] by [[Charles R. MacCluer]] -- Uses the topological definition of the limit rather than the traditional delta-epsilon approach.24 KB (3,198 words) - 19:44, 4 December 2024
- [[Category:Definition]] [[Category:Mathematics]]6 KB (902 words) - 17:16, 22 October 2024
- ===A More Precise Definition=== [[Category:Definition]]6 KB (1,100 words) - 14:57, 30 August 2024
- [[Category:Definition]]3 KB (532 words) - 21:00, 13 January 2024
- ...+ b_n = k.</cmath> Therefore, <math>k \geq n</math>. This contradicts our definition that <math>n>k</math>. Therefore, our assumption must be incorrect; at leas ...>K</math> be a set of <math>k</math> boxes such that <math>n>k</math>. The definition that <math>|N| > |K|</math> (as in our problem) is that there exists a surj11 KB (1,986 words) - 18:13, 19 June 2024
- [[Category:Definition]]2 KB (264 words) - 11:04, 15 July 2021
- [[Category:Definition]]2 KB (245 words) - 17:45, 14 October 2024
- [[Category:Definition]]4 KB (615 words) - 10:43, 21 May 2021
- == Definition == ...\cdot 1 = \prod_{i=1}^n i</math>. Alternatively, a [[recursion|recursive definition]] for the factorial is <math>n!=n \cdot (n-1)!</math>.10 KB (809 words) - 15:40, 17 March 2024
- [[Category:Definition]]4 KB (768 words) - 16:56, 24 June 2024
- [[Category:Definition]]3 KB (404 words) - 19:56, 28 December 2024
- ...{p \choose k}</math> for <math>1 \le k \le p-1</math>. This follows by the definition of the binomial coefficient as <math>{p \choose k} = \frac{p!}{k! (p-k)!}</ ...by rotation. The identity fixes all <math>a^p</math> of the colorings by definition. If <math>g\in C_p</math> where <math>g\ne e</math> then <math>g</math> pe16 KB (2,660 words) - 22:42, 28 August 2024
- ...Intermediate level geometry problems. It also provides the basis for the definition of a [[metric space]] in [[analysis]].7 KB (1,300 words) - 00:11, 28 October 2024
- == Definition == [[Category:Definition]]2 KB (275 words) - 11:51, 26 July 2023
- [[Category:Definition]]1 KB (162 words) - 19:39, 9 March 2024
- Thus by the definition of Euler's phi we have that <math>|A_d^\prime|=\phi (n/d)</math>. As every5 KB (903 words) - 14:49, 27 July 2024
- == Formal Definition of Probability ==4 KB (590 words) - 10:52, 28 September 2024
- == Definition == ...th>. We may write this relation as <cmath>b \mid a.</cmath> An alternative definition of divisibility is that the fraction <math>a / b</math> is an integer — o2 KB (277 words) - 15:21, 29 April 2023
- Using this definition, we can show that <math>\mathbb{R}</math> possesess all the properties ment [[Category:Definition]]3 KB (496 words) - 22:22, 5 January 2022