Problem 94

DOI10.1016/0012-365X(88)90034-9MaRDI QIDQ1102965zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(88)90034-9

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Review text

The problem is the following: Given integers \(n, m\), how many distinct solutions \(\{a,b,c\}\) are there to the system of equations \(a+b+c=m\), \(a^ 2+b^ 2+c^ 2=n\) with \(a\geq b\geq c\geq 0?\) Mind that the problem was solved with the condition of non-negativity removed for \(a, b\), and \(c\) by \textit{N. G. De Bruijn} in Nieuw. Arch. Wisk., 2. Ser. 22, 53-56 (1943; Zbl 0028.34402).

Recommendations

• scientific article; zbMATH DE number 3044815
• scientific article; zbMATH DE number 40446
• A simple number theoretic problem. III.
• On the number of solutions of the equation \(x_ 1^ 2+ \dots+ x_ n^ 2=nx_ 1 \dots x_ n\), not exceeding a given limit
• Two Equal Sums of Three Squares with Equal Products

Cited in

(2)

• Concerning the complexity of deciding isomorphism of block designs
• scientific article; zbMATH DE number 3044815 (Why is no real title available?)

This page was built for publication: Problem 94

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102965)