Options

Exercise 74 - Chapter 1

edited June 2018 in Exercises

Recall the division ordering on \(\mathbb{N}\) from Example 1.29: we say that \(n \le m\) if \(n\) divides perfectly into \(m\) What is the meet of two numbers in this poset? What about the join?

Figure

Comments

  • 1.

    The join is the least common multiple, and the meet is the greatest common divisor.

    Comment Source:The join is the least common multiple, and the meet is the greatest common divisor.
Sign In or Register to comment.