Problem 2737. Prouhet–Tarry–Escott (basic)

Created by Jan Orwat in Community

Solve Later

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

Last solution submitted on Jul 21, 2018

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

Solution 1200234

1 Comment

1 Comment

yurenchu on 31 May 2017

This solution is correct. The only reason it fails at test 4 is because the test suite can' t deal correctly with any sets that have elements that are bigger than 250.

Solution 1200172

1 Comment

1 Comment

yurenchu on 29 May 2017

This solution has an error that will only manifest when n >= 13. The corrected version is Solution 1200230.

Problem 2737. Prouhet–Tarry–Escott (basic)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Recent Solvers6

Suggested Problems

More from this Author47

Tags

Problem 2737. Prouhet–Tarry–Escott (basic)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Recent Solvers6

Suggested Problems

More from this Author47

Tags

Players