Howdy, Stranger!
It looks like you're new here. If you want to get involved, click one of these buttons!
Categories
- All Categories 2.3K
- Chat 498
- Study Groups 16
- Petri Nets 7
- Epidemiology 3
- Leaf Modeling 1
- Review Sections 9
- MIT 2020: Programming with Categories 52
- MIT 2020: Lectures 21
- MIT 2020: Exercises 25
- MIT 2019: Applied Category Theory 339
- MIT 2019: Lectures 79
- MIT 2019: Exercises 149
- MIT 2019: Chat 50
- UCR ACT Seminar 4
- General 65
- Azimuth Code Project 110
- Statistical methods 2
- Drafts 2
- Math Syntax Demos 15
- Wiki - Latest Changes 3
- Strategy 113
- Azimuth Project 1.1K
- - Spam 1
- News and Information 147
- Azimuth Blog 149
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 707
Options
Exercise 74 - Chapter 1
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?
Comments
The join is the least common multiple, and the meet is the greatest common divisor.
The join is the least common multiple, and the meet is the greatest common divisor.