There is an interesting (and documented) number-theoretic function in MMA called PowersRepresentations[$n$, $k$, $p$].
It gives the distinct representations of the integer $n$ as a sum of $k$ non-negative $p$-th integer powers.
I recently heard about related undocumented function SumOfSquaresReps.
How can I find out more on that undocumented function (number of arguments etc.)? What does it do exactly? How does it relate to PowersRepresentations, esp. performance-wise? Is there SumOfCubesReps, etc.?
The only place on the Internet known to me where this function is mentioned and used is @kglr answer to a question on this site.
Related:
Reduce`SumOfSquaresReps[k, n]returns all possible lists ofkpositive integers whose squares sum ton. – J. M.'s missing motivation Aug 30 '15 at 15:51Spelunk[Reduce\SumOfSquaresReps]` (you need "spelunking tools" for this, see this post to get them). – MarcoB Aug 30 '15 at 18:19SumOfSquaresReps:ClearAttributes[Reduce`SumOfSquaresReps, ReadProtected];??Reduce`SumOfSquaresReps. What would be more credible and official than the code itself? – MarcoB Oct 16 '17 at 04:33