Search results

  • ...<math>(1, 2, 3, 4, 5, 6, 7, 8, 9)</math>, excluding the empty set (<math>\emptyset</math>) and the one-digit integers. So, the number of upno integers is <mat
    8 KB (1,195 words) - 12:03, 26 February 2024
  • <math>\text{heap}(0) = \{\} = *\text{mex}(\emptyset) = 0</math>
    10 KB (1,628 words) - 18:50, 7 February 2024
  • We can easily see that all ordered partitions (except <math>A = \emptyset</math>) guarantee feasible solutions of <math>z</math>.
    4 KB (682 words) - 17:07, 2 May 2024
  • ...emainder). It is easy to verify <math>B \cap A_{1+\left[\log _2 p\right]}=\emptyset</math>. Obviously, <math>B</math> is also a good set, so <math>\Omega-</mat
    13 KB (2,406 words) - 05:36, 25 May 2024
  • ...emainder). It is easy to verify <math>B \cap A_{1+\left[\log _2 p\right]}=\emptyset</math>. Obviously, <math>B</math> is also a good set, so <math>\Omega-</mat
    13 KB (2,411 words) - 16:39, 4 June 2024

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