Search results

  • ...lfloor\log_{10}x\rfloor = 0</math>. These intervals are obviously pairwise disjoint. For any <math>k\geq 0</math> the corresponding interval is disjoint with <math>(0,1)</math>, so it does not contribute to our answer. On the ot
    3 KB (485 words) - 13:09, 21 May 2021
  • ...ath>, <math>\displaystyle 1 \leq i \leq n</math>, from the plane, pairwise disjoint, such that:
    11 KB (1,779 words) - 13:57, 7 May 2012
  • Two [[set]]s are said to be '''disjoint''' if they have no [[element]] in common. For example, ...sets, while <math>\{1, 2, 3\}</math> and <math>\{2, 4, 6\}</math> are not disjoint.
    853 bytes (121 words) - 12:38, 29 October 2006
  • ...ed into two classes. Prove that there are at least <math>n</math> pairwise disjoint sets in the same class.
    3 KB (539 words) - 12:42, 4 July 2013
  • ...into two classes. Prove that there are at least <math>n</math> [[pairwise disjoint]] sets in the same class. Claim: If we have instead <math>k(n+1)-1</math> elements, then we must have k disjoint subsets in a class.
    6 KB (1,073 words) - 14:36, 2 October 2024
  • ...{i \in I}</math> be a family of cycles of <math>S_M</math> with pairwise [[disjoint]] supports <math>(S_i)_{i \in I}</math>. Then the <math>\zeta_i</math> com ...ts a unique set <math>C</math> of cycles of <math>S_M</math> with pairwise disjoint supports such that
    3 KB (616 words) - 21:13, 12 January 2017
  • ...he set of all nonnegative integers can be written as the union of pairwise disjoint historic sets. We see that if this works, all sets will be pairwise disjoint, as at every stage, we only include integers which are not colored. Also, t
    2 KB (494 words) - 16:34, 5 July 2020
  • be divided into <math>n</math> [[disjoint]] <math>4</math>-element [[subset]]s such that every one of the <math>n</ma ...of respective angles <math>PAB, PBC</math>, and <math>PCA</math> intersect pairwise at <math>X=\ell_A\cap\ell_C, Y=\ell_A\cap\ell_B</math>, and <math>Z=\ell_B\
    71 KB (11,749 words) - 11:39, 20 November 2024
  • <math>X, Y</math> and <math>Z</math> are pairwise disjoint sets of people. The average ages of people in the sets
    17 KB (2,535 words) - 12:45, 19 February 2020
  • <math>X, Y</math> and <math>Z</math> are pairwise disjoint sets of people. The average ages of people in the sets ...math>, <math>Y</math>, and <math>Z</math> respectively. Since the sets are disjoint, we know, for example, that the number of people in the set <math>X \cup Y<
    2 KB (332 words) - 13:35, 27 February 2018
  • ...the Axiom of choice says, given a set <math>S</math> of non-empty pairwise disjoint sets, there exists a set <math>X</math> with one element from each set in <
    1 KB (203 words) - 00:25, 12 January 2024
  • ...such that the sets <math>\{a + x_i \mid a \in A\}</math> are all pairwise disjoint.
    1 KB (218 words) - 15:09, 24 November 2019
  • ...>4\cdot 48=192</math>. If <math>XY</math> and <math>ZW</math> are pairwise disjoint, then <math>|T(XY)\cap T(ZW)|=2^2\cdot4!=96</math>. There are <math>6</math
    9 KB (1,592 words) - 23:21, 7 August 2024
  • one can find at least four distinct elements in S so that none of their pairwise products is ...at least four distinct elements in <math>S</math> such that none of their pairwise products is a perfect square, we can proceed as follows:
    3 KB (542 words) - 11:08, 1 October 2024
  • ...rgest positive integer <math>L</math> such that there exist <math>L</math> pairwise distinct good subsets <math>A_1, A_2, \ldots, A_L</math> of <math>\Omega</m which are disjoint and both good sets (Lemma 2), with one part contained in <math>A_k</math> (
    13 KB (2,406 words) - 04:36, 25 May 2024
  • ...rgest positive integer <math>L</math> such that there exist <math>L</math> pairwise distinct good subsets <math>A_1, A_2, \ldots, A_L</math> of <math>\Omega</m which are disjoint and both good sets (Lemma 2), with one part contained in <math>A_k</math> (
    13 KB (2,411 words) - 15:39, 4 June 2024
  • ...such that the sets <math>\{a + x_i \mid a \in A\}</math> are all pairwise disjoint.
    2 KB (350 words) - 08:38, 5 July 2024