Problem 2737. Prouhet–Tarry–Escott (basic)

Created by Jan Orwat
Appears in Card Games

Like (0)

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Inspired by problem 660.

Given n return two disjoint sets of integers A and B with same cardinality having following property:

for i = 1:n

Try to minimize sets cardinality.

Solve

Solution Stats

34 Solutions
7 Solvers

Last Solution submitted on Mar 18, 2021

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

LY Cao on 7 Oct 2016

assert(isequal(sum(A(:).^(1:n)), sum(A(:).^(1:n)))), makes it too basic.
( ·_ゝ·)

Jan Orwat on 8 Oct 2016

I have no idea what I was thinking of when I wrote this. Thanks for pointing that out so quickly.

Solution Comments

Show comments

ANNOUNCEMENT

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers7

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 2737. Prouhet–Tarry–Escott (basic)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers7

Suggested Problems

More from this Author40

Problem Tags

Community Treasure Hunt

Problem 2737. Prouhet–Tarry–Escott (basic)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers7

Suggested Problems

More from this Author40

Problem Tags

Community Treasure Hunt

Players