Search results

  • ...= 18^2 = 324</math>. For any positive integer <math>n</math>, consider all nonempty subsets <math>S</math> of <math>\{1, 2, . . . , n\}</math> that do not cont
    5 KB (768 words) - 23:59, 28 September 2024
  • For <math>\{1, 2, 3, \ldots, n\}</math> and each of its nonempty subsets a unique '''alternating sum''' is defined as follows. Arrange the n
    7 KB (1,104 words) - 02:13, 27 May 2024
  • ....</math> Let <math>S_n</math> be the sum of the complex power sums of all nonempty [[subset]]s of <math>\{1,2,\ldots,n\}.</math> Given that <math>S_8 = - 176
    7 KB (1,084 words) - 01:01, 28 November 2023
  • ....</math> Let <math>S_n</math> be the sum of the complex power sums of all nonempty [[subset]]s of <math>\{1,2,\ldots,n\}.</math> Given that <math>S_8 = - 176
    2 KB (385 words) - 15:47, 14 September 2024
  • ...h> not containing a product of prime ideals, so <math>\mathcal S</math> is nonempty and <math>R\not\in \mathcal S</math>. As <math>R</math> is noetherian, <mat
    9 KB (1,648 words) - 15:36, 14 October 2017
  • Let <math>A_1, A_2, \ldots , A_{63}</math> be the 63 nonempty subsets of <math>\{ 1,2,3,4,5,6 \}</math>. For each of these sets <math>A_
    2 KB (263 words) - 17:13, 19 October 2021
  • Let <math>A_1, A_2, \ldots , A_{63}</math> be the 63 nonempty subsets of <math>\{ 1,2,3,4,5,6 \}</math>. For each of these sets <math>A_
    14 KB (2,102 words) - 21:03, 26 October 2018
  • ...of particular importance in [[combinatorics]]. Let <math>I</math> be any [[nonempty]] index [[set]]. Informally, a free group on <math>I</math> is the collect
    2 KB (454 words) - 16:54, 16 March 2012
  • A set <math>S</math> is said to be '''complete''' if any [[empty set | nonempty]] [[set|subset]] of <math>S</math> that is [[bounded]] above has a supremum
    1,011 bytes (177 words) - 13:08, 5 March 2022
  • ...integers such that <math>s\left(\sum_{x\in X} x\right) = k</math> for any nonempty subset <math>X\subset S</math>. Prove that there are constants <math>0 < C
    4 KB (609 words) - 08:24, 14 May 2021
  • ...able integers are nonnegative, thus the set of non-purchasable integers is nonempty. ...1</math>. Then <math>(Nx')m+(Ny')n = N</math>. Hence <math>A_{N}</math> is nonempty. It is easy to check that <math>(Nx'+kn,Ny'-km) \in A_{N}</math> for all <m
    17 KB (2,823 words) - 22:06, 15 November 2024
  • ...he relation ''belongs to'' is [[well-founded]]. In other words, for every nonempty set <math>A</math>, there exists a set <math>a \in A</math> which is disjoi
    4 KB (732 words) - 19:49, 13 October 2019
  • In [[graph theory]], a '''graph''' is a (usually [[finite]]) [[empty set | nonempty]] [[set]] of [[vertex|vertices]] that are joined by a number (possibly zero
    8 KB (1,428 words) - 09:26, 27 August 2020
  • For any nonempty set <math>\,S\,</math> of numbers, let <math>\,\sigma(S)\,</math> and <math where "<math>\Sigma</math>" denotes a sum involving all nonempty subsets <math>S</math> of <math>\{1,2,3, \ldots,n\}</math>.
    3 KB (490 words) - 06:38, 19 July 2016
  • For any nonempty set <math>\,S\,</math> of numbers, let <math>\,\sigma(S)\,</math> and <math where "<math>\Sigma</math>" denotes a sum involving all nonempty subsets <math>S</math> of <math>\{1,2,3, \ldots,n\}</math>.
    3 KB (512 words) - 18:17, 18 July 2016
  • For a nonempty set <math>S</math> of integers, let <math>\sigma(S)</math> be the sum of th
    5 KB (858 words) - 06:52, 19 July 2016
  • ...> which are elements of <math>\mathcal{F}</math>, ordered by inclusion, is nonempty and finite, and must have a least element. This least element must then be
    9 KB (1,685 words) - 19:28, 13 October 2019
  • ...\{a_n|n\in\mathbb{Z}\}</math>. <math>a_1\in S</math>, so <math>S</math> is nonempty. It is easy to see that <math>a_n=1-(.1)^n</math> since it is a finite geom
    3 KB (577 words) - 19:04, 4 February 2023
  • ...o <math>m</math> paths is a set <math>\mathcal{P}</math> of <math>m</math> nonempty paths such that each point in <math>S_n</math> appears in exactly one of th
    9 KB (1,585 words) - 00:00, 14 August 2014
  • ...o <math>m</math> paths is a set <math>\mathcal{P}</math> of <math>m</math> nonempty paths such that each point in <math>S_n</math> appears in exactly one of th
    4 KB (674 words) - 20:48, 12 August 2014

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