Timeline for Is this number Loeschian?
Current License: CC BY-SA 4.0
57 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 21, 2022 at 19:58 | answer | added | l4m2 | timeline score: 1 | |
| Dec 19, 2022 at 13:51 | answer | added | angel_p_57 | timeline score: 1 | |
| Jan 16, 2021 at 22:43 | answer | added | Xcali | timeline score: 1 | |
| Jan 16, 2021 at 19:08 | answer | added | hakr14 | timeline score: 1 | |
| Jan 16, 2021 at 17:25 | history | edited | Luis Mendo | CC BY-SA 4.0 |
deleted 10 characters in body
|
| Jan 16, 2021 at 17:10 | history | edited | Luis Mendo | CC BY-SA 4.0 |
added 66 characters in body
|
| Jan 16, 2021 at 16:48 | comment | added | Rosie F | Your "equivalent characterization" involving a tessellation is bogus, because a straight line of $k$ hexagons is a shape which tessellates the plane, for any positive integer $k$. But you may say instead, that on the lattice of centres of these hexagons (or equivalently of corners in a tessellation of equilateral triangles, complete edge to complete edge), there are two lattice points at distance $\sqrt{k}$. | |
| Oct 16, 2020 at 15:59 | answer | added | caird coinheringaahin g♦ | timeline score: 1 | |
| Oct 16, 2020 at 2:02 | answer | added | Aiden Chow | timeline score: 2 | |
| Oct 13, 2020 at 8:09 | answer | added | Razetime | timeline score: 1 | |
| Oct 12, 2020 at 14:32 | answer | added | Shaggy | timeline score: 1 | |
| Oct 11, 2020 at 14:59 | history | edited | caird coinheringaahin g♦ | CC BY-SA 4.0 |
added 83 characters in body
|
| Oct 11, 2020 at 12:43 | comment | added | uhoh | Find all integer pairs that produce a given Loeschian number My first question here, I've borrowed from your question quite a bit, but I think the continuity is helpful, and you did such a nice job writing this up. | |
| Aug 16, 2020 at 20:44 | answer | added | DLosc | timeline score: 4 | |
| Aug 15, 2020 at 8:49 | answer | added | Rosie F | timeline score: 1 | |
| Jul 2, 2020 at 13:48 | answer | added | Kevin Cruijssen | timeline score: 2 | |
| Jul 1, 2020 at 16:04 | answer | added | caird coinheringaahin g♦ | timeline score: 1 | |
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jun 5, 2020 at 12:59 | comment | added | Luis Mendo | @uhoh Your actual question seems much more complicated though. Sorry that I cannot contribute to it | |
| Jun 5, 2020 at 12:18 | comment | added | uhoh | I just ran across this while working on this | |
| May 17, 2020 at 17:14 | history | edited | Luis Mendo | CC BY-SA 4.0 |
Image links were not working. Corrected
|
| Jan 6, 2017 at 14:08 | answer | added | Titus | timeline score: 1 | |
| Jan 6, 2017 at 13:22 | history | edited | Luis Mendo | CC BY-SA 3.0 |
added 101 characters in body
|
| Jan 6, 2017 at 13:13 | comment | added | Luis Mendo | @Titus Oh now I see. For each pair of integers i, j there's a non-negative pair that gives the same k | |
| Jan 6, 2017 at 12:32 | comment | added | Titus |
i, j non-negative integers or 9 (i=-3, j=3) - which one is it?
|
|
| Jan 6, 2017 at 10:45 | answer | added | aluriak | timeline score: 1 | |
| Jan 6, 2017 at 9:31 | answer | added | Greg Martin | timeline score: 1 | |
| Nov 18, 2016 at 5:43 | history | edited | user45941 |
edited tags
|
|
| Aug 16, 2016 at 11:18 | vote | accept | Luis Mendo | ||
| Aug 5, 2016 at 19:41 | answer | added | owacoder | timeline score: 1 | |
| Aug 5, 2016 at 19:07 | history | tweeted | twitter.com/StackCodeGolf/status/761639809467244544 | ||
| Aug 5, 2016 at 12:50 | review | Suggested edits | |||
| Aug 5, 2016 at 13:00 | |||||
| Aug 4, 2016 at 20:46 | answer | added | xnor | timeline score: 7 | |
| Aug 4, 2016 at 19:28 | answer | added | Adám | timeline score: 1 | |
| Aug 4, 2016 at 18:49 | answer | added | Leaky Nun | timeline score: 5 | |
| Aug 4, 2016 at 18:27 | answer | added | Joffan | timeline score: 3 | |
| Aug 4, 2016 at 18:11 | answer | added | Dada | timeline score: 1 | |
| Aug 4, 2016 at 17:31 | answer | added | Dennis | timeline score: 26 | |
| Aug 4, 2016 at 17:29 | answer | added | Brad Gilbert b2gills | timeline score: 1 | |
| Aug 4, 2016 at 17:19 | comment | added | Rod | note for the brute force algorithm: if you iterate to √k you reduce algorithm complexity from O(n²) to O(n), at expense of some bytes c; | |
| Aug 4, 2016 at 16:45 | answer | added | pajonk | timeline score: 1 | |
| Aug 4, 2016 at 16:18 | answer | added | orlp | timeline score: 6 | |
| Aug 4, 2016 at 16:14 | answer | added | Justin | timeline score: 5 | |
| Aug 4, 2016 at 16:13 | answer | added | atlasologist | timeline score: 4 | |
| Aug 4, 2016 at 16:10 | answer | added | Peter Taylor | timeline score: 14 | |
| Aug 4, 2016 at 16:07 | answer | added | applejacks01 | timeline score: 1 | |
| Aug 4, 2016 at 16:01 | answer | added | Martin Ender | timeline score: 19 | |
| Aug 4, 2016 at 15:58 | answer | added | TheLethalCoder | timeline score: 2 | |
| Aug 4, 2016 at 15:56 | answer | added | orlp | timeline score: 3 | |
| Aug 4, 2016 at 15:55 | answer | added | nimi | timeline score: 6 | |
| Aug 4, 2016 at 15:53 | answer | added | AdmBorkBork | timeline score: 1 | |
| Aug 4, 2016 at 15:47 | history | edited | Luis Mendo | CC BY-SA 3.0 |
deleted 23 characters in body
|
| Aug 4, 2016 at 15:44 | answer | added | Luis Mendo | timeline score: 4 | |
| Aug 4, 2016 at 15:40 | answer | added | Leaky Nun | timeline score: 4 | |
| Aug 4, 2016 at 15:39 | history | edited | Luis Mendo | CC BY-SA 3.0 |
edited body
|
| Aug 4, 2016 at 15:35 | comment | added | Luis Mendo | Related (as noted by @PeterTaylor) | |
| Aug 4, 2016 at 15:34 | history | asked | Luis Mendo | CC BY-SA 3.0 |