| Display title | Prouhet–Tarry–Escott problem |
| Default sort key | Prouhet-Tarry-Escott problem |
| Page length (in bytes) | 6,831 |
| Namespace ID | 0 |
| Page ID | 224701 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Corlink |
| Date of page creation | 10:05, 24 October 2022 |
| Latest editor | imported>Corlink |
| Date of latest edit | 10:05, 24 October 2022 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In mathematics, the Prouhet–Tarry–Escott problem asks for two disjoint multisets A and B of n integers each, whose first k power sum symmetric polynomials are all equal.
That is, the two multisets should satisfy the equations
$ \sum _{a\in A}a^{i}=\sum _{b\in B}b^{i} $
for each integer i from 1 to a... |
