Search results

  • ...ery <math>s \in S</math> and there is no <math>m < M</math> with this same property. If the least upper bound <math>M</math> of <math>S</math> is an element of <math>S</math>, it is als
    1,011 bytes (177 words) - 13:08, 5 March 2022
  • ...in \mathbb{Z}_{> 0}\right\}</math>. While this set has a [[greatest lower bound]] 0, it has no minimum. ...rty]], then <math>S</math> has a minimum if and only if the greatest lower bound of <math>S</math> is a member of <math>S</math>.
    1 KB (232 words) - 12:12, 9 February 2007
  • ...ery <math>s \in S</math> and there is no <math>M > m</math> with this same property. If the greatest lower bound <math>m</math> of <math>S</math> is an element of <math>S</math>, it is als
    597 bytes (109 words) - 12:55, 5 March 2022
  • ...ually. If there are <math>2000</math> gold coins in the chest, what is the greatest number of gold coins Tony could take as his share? (Assume each gold coin i ...math>40</math> nickels, he computes <math>88</math> as his score. Find the greatest number of nickels he could have successfully tossed into the jar.
    71 KB (11,749 words) - 11:39, 20 November 2024
  • Let <math>N</math> be the greatest integer multiple of <math>36</math> all of whose digits are even and no two ...>b</math> are integers satisfying <math>1\le a < b \le 20</math>. Find the greatest positive integer <math>n</math> such that <math>2^n</math> divides <math>K<
    8 KB (1,246 words) - 20:58, 10 August 2020