Timeline for what ordinals were used in proving unique factorization over $\mathbb{Z}$ [closed]
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Mar 12, 2017 at 8:40 | history | closed |
Andrés E. Caicedo Sebastian Goette Franz Lemmermeyer Emil Jeřábek user1688 |
Needs details or clarity | |
| Mar 11, 2017 at 23:23 | comment | added | Gerry Myerson | I would not have known you were asking, "how many ordinals do we need..." if I hadn't read the comment. There is no mention of ordinals in the question. The only actual question in the question is something about Euclid's algortihm and recursive structures. | |
| Mar 11, 2017 at 19:16 | vote | accept | john mangual | ||
| Mar 11, 2017 at 17:59 | review | Close votes | |||
| Mar 12, 2017 at 8:40 | |||||
| Mar 11, 2017 at 17:41 | answer | added | Noah Schweber | timeline score: 2 | |
| Mar 11, 2017 at 17:16 | comment | added | john mangual | @KConrad please take question with a grain of salt. all I am saying is that in elementary number theory we introduce data structures on integers or sequences of integers. the rationals are a theory on pairs of integers. etc. then i am asking how many ordinals we need for fermat little theorem, quadratic reciprocity. and there's no fixed answer. | |
| Mar 11, 2017 at 16:29 | history | edited | john mangual | CC BY-SA 3.0 |
following a suggestion
|
| Mar 11, 2017 at 16:27 | comment | added | KConrad | The integer $0$ does not have a prime factorization. | |
| Mar 11, 2017 at 15:33 | history | asked | john mangual | CC BY-SA 3.0 |