Timeline for The number of ideals in a ring
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 25, 2019 at 7:21 | history | edited | Mare | CC BY-SA 4.0 |
added 27 characters in body
|
| Apr 25, 2019 at 0:11 | comment | added | Mare | @JeremyRickard Sorry, it was late and I did several mistakes. For now I just leave it with another question that might answer your question in case there is an example for this number theoretic problem. | |
| Apr 25, 2019 at 0:10 | history | edited | Mare | CC BY-SA 4.0 |
deleted 170 characters in body
|
| Apr 24, 2019 at 23:31 | history | edited | Mare | CC BY-SA 4.0 |
deleted 516 characters in body
|
| Apr 24, 2019 at 23:24 | history | edited | Mare | CC BY-SA 4.0 |
deleted 411 characters in body
|
| Apr 24, 2019 at 23:19 | history | edited | Mare | CC BY-SA 4.0 |
deleted 411 characters in body
|
| Apr 24, 2019 at 23:13 | history | edited | Mare | CC BY-SA 4.0 |
added 394 characters in body
|
| Apr 24, 2019 at 23:07 | comment | added | Mare | @JeremyRickard Too bad, but maybe the construction still works for higher $n$. This leads to a seemingly complicated number theory problem on how many divisors such a sum of gauss binomial coefficients can have. | |
| Apr 24, 2019 at 23:06 | history | edited | Mare | CC BY-SA 4.0 |
added 394 characters in body
|
| Apr 24, 2019 at 22:48 | comment | added | Jeremy Rickard | Unfortunately, when I wrote “number of prime factors” I meant counted with multiplicity (so 32 has five prime factors). Sorry: I did make this clear when I mentioned numbers of prime factors earlier in the post, but not in the statement of my question. | |
| Apr 24, 2019 at 21:09 | history | edited | Mare | CC BY-SA 4.0 |
added 166 characters in body
|
| Apr 24, 2019 at 21:01 | history | edited | Mare | CC BY-SA 4.0 |
added 326 characters in body
|
| Apr 24, 2019 at 20:50 | history | answered | Mare | CC BY-SA 4.0 |