Equal Sums of Like Powers

On the Integer Solutions of the Diophantine System

a1k + a2k + ... + amk = b1k + b2k + ... + bmk      ( k = k1 , k2 , ... , kn ) 


Equal Sums of Like Powers

Introduction


Equal Sums of Like Powers

Non-negative integer solutions of the m=n+1 case

a1k + a2k + ... + an+1k = b1k + b2k + ... + bn+1k      ( k = k1 , k2 , ... , kn )

When m=n+1, non-negative integer solutions have been found to 39 + 39 + 8 + 7 +1 = 94 types so far.
    Range of  k
    Solved Types
    Reference
    all k  > 0
    39
    See below.
    all k  < 0
    39
    See Results and discussion on the k < 0 case
    k1= 0 and all others k  > 0
    8
    See Equal products and equal sums of like powers .
    k1= 0 and all others k  < 0
    7
    See Results and discussion on the k < 0 case .
    k1< 0 and kn > 0
    1
    See Results and discussion on the k < 0 case .
    When all k > 0 and m=n+1, non-negative integer solutions have been found to the following 39 types:


Equal Sums of Like Powers

Integer solutions of the m=n case

a1h + a2h + ... + anh = b1h + b2h + ... + bnh      ( h = h1 , h2 , ... , hn )


Last revised May 6, 2001.

The main site: http://go6.163.com/~eslp (Created and maintained by Chen Shuwen )
The mirror site: http://euler.free.fr/eslp (Courtesy of Jean-Charles Meyrignac )
Redirect URL: http://eslp.yeah.net (Always point to the active updated site)
Chen Shuwen
Jiang Xing Electronics Limited,
138#, Shengli Road,
Jiangmen City, Guangdong Province, 529000
People's Republic of China

Copyright 1997-2001, Chen Shuwen