Timeline for Yet another question about unrestricted partitions
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 1, 2017 at 23:05 | comment | added | David S. Newman | @MaxAlekseyev Thanks for the code. Unfortunately I've been unable to follow it thusfar, perhaps because I'm unfamiliar with Pari. I've been using Mathematica only for the last several years. | |
| Sep 27, 2017 at 14:56 | comment | added | Max Alekseyev | @DavidS.Newman: I've added my code. It took about an hour and a half to complete the brute-force here. | |
| Sep 27, 2017 at 14:55 | history | edited | Max Alekseyev | CC BY-SA 3.0 |
added 660 characters in body
|
| Sep 27, 2017 at 14:44 | vote | accept | David S. Newman | ||
| Sep 27, 2017 at 14:42 | comment | added | David S. Newman | @MaxAlekseyev Thank you for this. How long did your search for the maximal series take? Could you provide me with the program? Your solution with degree 121 is better than I ever found. The next logical thing to try by way of a search is to write 1/(1-x^2) as 1+x^2+x^4+...before changing the signs. | |
| Sep 27, 2017 at 14:30 | history | edited | Max Alekseyev | CC BY-SA 3.0 |
added P.S.
|
| Sep 27, 2017 at 12:42 | comment | added | Max Alekseyev | @FedorPetrov: en.wikipedia.org/wiki/Backtracking | |
| Sep 27, 2017 at 12:38 | comment | added | Fedor Petrov | But on the first glance there are too many variants to check. | |
| Sep 27, 2017 at 12:36 | comment | added | Max Alekseyev | @FedorPetrov: I've brute-forced this. One of the maximum solutions is given above. | |
| Sep 27, 2017 at 12:33 | comment | added | Fedor Petrov | Why it is not possible? | |
| Sep 27, 2017 at 12:06 | history | answered | Max Alekseyev | CC BY-SA 3.0 |