Timeline for Given integer n and k, split the set {x| - 2^n + 1 ≤ x ≤ 2^n} into two subsets A and B, so that |A| = |B| and $\sum_{a\in A}a^k=\sum_{b\in B}b^k$
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 23, 2021 at 14:20 | history | edited | gmvh | CC BY-SA 4.0 |
Replaced tags, minor copyediting
|
| Feb 22, 2021 at 13:39 | answer | added | markvs | timeline score: 3 | |
| Feb 22, 2021 at 13:36 | comment | added | Vlad Matei | I think it is relevant for you to look at the so called Prouhet Tarry Escott Problem. It is a stronger version than what you ask, namely you need all the first few power sums equal. On the other hand because of the shape of your set in the question note that the Prouhet Thue Morse sequence gives you a solution for the partition into $A,B$ such that the first $k$th powers are equal where $0\leq k\leq N-1$. | |
| Feb 22, 2021 at 11:02 | review | First posts | |||
| Feb 22, 2021 at 12:14 | |||||
| Feb 22, 2021 at 10:52 | history | asked | Solarius | CC BY-SA 4.0 |