Waste less time on Facebook — follow Brilliant.
×

Ordering

Denote the set \( \lbrace \circledS \cup \{ 0 \} \rbrace \) as the set of natural number that is not divisible by \(2 \). And define the binary relation \( \ge \) on two natural number \( m , n \) , \( m \ge n \) if \( m = k n \) , for integer k, meaning that \( m \) divides \( n \).

How to show that \( \lbrace N \mid \ge \rbrace \) is order-isomorphc to \( \lbrace \circledS \mid \ge \rbrace \) ?

Note by L Km
1 week, 6 days ago

No vote yet
1 vote

Comments

There are no comments in this discussion.

×

Problem Loading...

Note Loading...

Set Loading...