Open Problem Garden
Help
About
Contact
login/create account
Home
»
Author index
Euler, Leonhard P.
Number Theory
»
Computational N.T.
A sextic counterexample to Euler's sum of powers conjecture
★★
Author(s):
Euler
Problem
Find six positive integers
such that
or prove that such integers do not exist.
Keywords:
Posted by
maxal
updated August 5th, 2007
add new comment
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
Partition of Complete Geometric Graph into Plane Trees
Smooth 4-dimensional Poincare conjecture
more