×

# k-dimensional cube-tetrahedrons

I conjecture that $$n^k = \dfrac{m(m+1)\cdots(m+k-1)}{k!}$$, where $$n,m,k$$ are positive integers, has an infinite amount of solutions for $$n$$ if $$k \leq 2$$ and that $$n = 1$$ is the only possible value of $$n$$ if $$k > 2$$.

I am able to prove the case where $$k \leq 2$$, but I am unable to prove the case where $$k > 2$$.

Note by Jesse Nieminen
11 months, 1 week ago

Sort by:

Proof for case $$k \leq 2$$:

If $$k = 1$$ clearly $$n = m$$ which has an infinite amount of solutions.

If $$k = 2$$,

\begin{align} &n^2 = \dfrac{m(m+1)}{2} \\ &2n^2 = m^2 + m \\ &m^2 + m - 2n^2 = 0 \\ &m = \dfrac{-1 \pm \sqrt{1 + 8n^2}}{2} \\ &1 + 8n^2 = x^2 \\ &x^2 - 8n^2 = 1\end{align}

This is now a Pell's equation which is well know to have an infinite amount of solutions. · 11 months, 1 week ago

Have you considered looking at prime factorisations? It might work in the $$k=3$$ case. · 9 months, 4 weeks ago

Could you post the case $$k \leq 2$$? Perhaps something in your solution will inspire · 11 months, 1 week ago