Timeline for Pseudo-partitions of $\mathbb{N}$
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 5 at 6:56 | vote | accept | Dominic van der Zypen | ||
| Apr 4 at 18:39 | comment | added | paste bee | Yep. (I had already mostly written an answer, ...apparently we came up with the exact same example). | |
| Apr 4 at 18:37 | answer | added | paste bee | timeline score: 5 | |
| Apr 4 at 18:36 | comment | added | Daniel Weber | Right. But I think if you add $\mathbb{N}\setminus\{1\}$ it works? | |
| Apr 4 at 18:36 | comment | added | paste bee | That doesn't have a pseudo-partition with $0$ as the exceptional element. | |
| Apr 4 at 18:35 | comment | added | Daniel Weber | Ah, right, the collection can be infinite. What about $\mathbb{N} \setminus \{0\}$ and all pairs which contain $0$? | |
| Apr 4 at 18:33 | comment | added | paste bee | No, {{0,1},{2,3},{4,5},...} is a partition of $\mathbb{N}$. | |
| Apr 4 at 18:33 | comment | added | Daniel Weber | Does taking all pairs and all cosingletons work? | |
| Apr 4 at 18:22 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |