Timeline for Longest sequence of Egyptian fractions with n as denominator
Current License: CC BY-SA 4.0
28 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 2, 2023 at 16:25 | vote | accept | Anm | ||
| Oct 2, 2023 at 9:34 | answer | added | 138 Aspen | timeline score: 1 | |
| Oct 2, 2023 at 8:47 | answer | added | Kevin Cruijssen | timeline score: 1 | |
| Oct 2, 2023 at 8:40 | comment | added | Philippos |
IANAM, but 1/1 is a valid unit fraction, so there is always a solution, even for n=1. Why am I wrong?
|
|
| Oct 1, 2023 at 10:06 | history | edited | Anm | CC BY-SA 4.0 |
added 1 character in body
|
| Oct 1, 2023 at 4:21 | comment | added | Anm | @138Aspen Already linked it in my question, though it is about the number of fractions | |
| Oct 1, 2023 at 3:29 | history | edited | Greg Martin | CC BY-SA 4.0 |
made "largest denominator" explicit
|
| Oct 1, 2023 at 2:10 | answer | added | Ajax1234 | timeline score: 2 | |
| Sep 30, 2023 at 23:30 | comment | added | 138 Aspen | Similar question: Egyptian fraction representations of 1 | |
| Sep 30, 2023 at 22:18 | answer | added | Neil | timeline score: 2 | |
| Sep 30, 2023 at 19:51 | answer | added | Jos Woolley | timeline score: 1 | |
| Sep 30, 2023 at 19:46 | history | edited | Anm | CC BY-SA 4.0 |
added 12 characters in body
|
| Sep 30, 2023 at 19:41 | comment | added | Anm | @JosWoolley I have added a rule saying that output any one solution when 2 or more exists, and mentioned the example | |
| Sep 30, 2023 at 19:40 | history | edited | Anm | CC BY-SA 4.0 |
added 63 characters in body
|
| Sep 30, 2023 at 19:38 | comment | added | Jos Woolley |
Perhaps worth mentioning that 1/3 + 1/5 + 1/9 + 1/10 + 1/12 + 1/15 + 1/18 + 1/20 is an equally valid solution for your third test case?
|
|
| Sep 30, 2023 at 18:42 | history | became hot network question | |||
| Sep 30, 2023 at 15:10 | history | edited | Anm | CC BY-SA 4.0 |
added 65 characters in body
|
| Sep 30, 2023 at 13:54 | answer | added | lyxal ♦ | timeline score: 1 | |
| Sep 30, 2023 at 13:15 | comment | added | Anm | @CommandMaster Thank you for your valuable feedback. I have changed the framing to remove 'consecutive' as it is not required. For the scoring criteria, I have omitted the tiebreaker part. Also I agree for you on the output format, but someone has already submitted an answer so its too late now, but I will keep that in mind. Thank you for bringing my attention to the sandbox. | |
| Sep 30, 2023 at 13:09 | history | edited | Anm | CC BY-SA 4.0 |
deleted 88 characters in body; edited title
|
| Sep 30, 2023 at 12:23 | answer | added | Arnauld | timeline score: 2 | |
| Sep 30, 2023 at 11:54 | comment | added | Command Master | (cont.) clarify on which tests the speed is determined. It's quite unlikely that a language will have two solutions with the same length but significantly different time, so the tiebreaker might not be relevant. I suggest first posting challenges to the sandbox in the future | |
| Sep 30, 2023 at 11:54 | comment | added | Command Master |
Nice first challenge! Some suggestions: from the testcases, it seems like \$n\$ has to be the greatest denominator, and they don't have to be consecutive — you should clarify that in the challenge text. Additionally, I'd suggest having a looser output format — I don't see why we can't output as [2,3,6], for example, or why the order is important. For the scoring criteria, saying "shortest code wins, with time as tiebreaker" would be clearer. You should ...
|
|
| Sep 30, 2023 at 11:08 | history | edited | Anm | CC BY-SA 4.0 |
added 22 characters in body
|
| Sep 30, 2023 at 10:53 | history | edited | Anm | CC BY-SA 4.0 |
deleted 10 characters in body
|
| Sep 30, 2023 at 10:47 | history | edited | Anm | CC BY-SA 4.0 |
added 10 characters in body
|
| S Sep 30, 2023 at 10:42 | review | First questions | |||
| Sep 30, 2023 at 11:51 | |||||
| S Sep 30, 2023 at 10:42 | history | asked | Anm | CC BY-SA 4.0 |