Search results

From Maths
Jump to: navigation, search

Page title matches

Page text matches

  • After a discussion with an expert in the field, I shall make it clear that algebras and sigma-
    2 KB (232 words) - 03:57, 30 March 2016
  • {{Stub page|grade=A|msg=This requires some pictures or at least discussion, the constraint that {{M|1=\sum^N_{i=0}t_i=1}} is interesting. It doesn't r
    1 KB (238 words) - 22:19, 4 May 2016
  • {{Todo|Discussion of this proof, finish it, although I've done the work, all you need to do i
    2 KB (333 words) - 10:11, 10 May 2016
  • ...is remarkably small. It just looks verbose because of the large amounts of discussion involved. This page is my attempt to "compress" the skeleton of what is nee
    4 KB (716 words) - 14:24, 16 May 2016
  • : {{Note|'''Note:''' See ''[[Passing to the infimum]]'' for a discussion of the motivation and conditions}}}}<noinclude>
    641 B (105 words) - 00:55, 21 May 2016
  • : Be sure to check [[Discussion of the free monoid and free semigroup generated by a set]], as there are so
    2 KB (419 words) - 16:20, 20 July 2016
  • ...group (as all monoids are semgroups), however there is a difference, see [[Discussion of the free monoid and free semigroup generated by a set]] ...[[free monoid generated by]] (which of course is also a semigroup) - see [[discussion of the free monoid and free semigroup generated by a set]]){{rAAPAG}}, defi
    1 KB (200 words) - 07:07, 21 July 2016
  • ...[\vert a-x\vert < \delta\implies\vert f(a)-f(x)\vert < \epsilon]}} - and a discussion of why this is intuitive, and how to generalise it to higher dimensions (st
    3 KB (668 words) - 22:38, 4 August 2016
  • ==Discussion==
    2 KB (275 words) - 12:29, 15 September 2016
  • ...fined to have boundary 0, thus {{M|1=Z_n=\text{Ker}(\partial_n)}} - todo - discussion)
    6 KB (897 words) - 07:30, 15 October 2016
  • ...hope I don't need to prove {{M|\frac{1}{2} }} is sufficient? However for a discussion see the caption of the picture on the right.}})
    8 KB (1,450 words) - 12:34, 12 October 2016
  • ==Discussion==
    2 KB (287 words) - 19:31, 28 October 2016
  • ==Discussion== {{Requires work|grade=C|msg=Do discussion}}
    470 B (63 words) - 12:13, 30 November 2016
  • ...basis vectors. It's not that big of a leap, so shouldn't require any more discussion</ref>
    5 KB (966 words) - 14:36, 6 February 2017
  • ...|U:\eq \varphi'^{-1}\big(B_\delta(\varphi'(p);\mathbb{R}^n)\big)}}, by the discussion above we see {{M|U\in\mathcal{O}(p,X)}}
    4 KB (667 words) - 14:32, 20 February 2017
  • : This is discussion of the workings of an Enigma machine, see [[Logical workings of the Enigma
    5 KB (834 words) - 14:25, 15 December 2017
  • ...nk|sentences|formal languages}} or {{link|strings|formal languages}} under discussion
    1 KB (153 words) - 00:37, 13 January 2018
  • A discussion can be found on the [[DFA#Definition|DFA's page "definition" section]] - I
    3 KB (541 words) - 22:22, 17 January 2018
  • ...ations and permutations]] for an informal (word/colloquial) definition and discussion of what a combination and indeed a [[permutation]] is.
    3 KB (506 words) - 16:32, 14 April 2018
  • {{Begin Inline Theorem}}Informal discussion: {{Begin Inline Theorem}}Discussion on the basics of reading [[FOL]] statements:{{Begin Inline Proof}}This stat
    3 KB (569 words) - 22:15, 8 May 2018

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