Dudley triangle

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

:Dudley Triangle may also refer to a neighborhood of Boston, Massachusetts. In mathematics, the Dudley triangle is a triangular array of integers that was defined by . It consists of the numbers : \begin{matrix} &&&&&2&&&&\\ &&&&2&&2&&&\\ &&&2&&1&&2&&\\ &&2&&0&&0&&2&\\ &2&&6&&5&&6&&2\\ &&&&&\vdots&&&& \end{matrix} . Dudley exhibited several rows of this triangle, and challenged readers to find the next row; the challenge was met by J. G. Mauldon, who proposed two different solutions. In one of Mauldon's solutions, the number at the intersection of the mth and nth diagonals (counting the top of the triangle as having m = n = 1) is given by the formula a(n,m) = m^2 + mn + n^2 - 1 \mod (n+m+1).

Dudley Triangle may also refer to a neighborhood of Boston, Massachusetts. In mathematics, the Dudley triangle is a triangular array of integers that was defined by . It consists of the numbers \begin{matrix} &&&&&2&&&&\\ &&&&2&&2&&&\\ &&&2&&1&&2&&\\ &&2&&0&&0&&2&\\ &2&&6&&5&&6&&2\\ &&&&&\vdots&&&& \end{matrix} . Dudley exhibited several rows of this triangle, and challenged readers to find the next row; the challenge was met by J. G. Mauldon, who proposed two different solutions. In one of Mauldon's solutions, the number at the intersection of the mth and nth diagonals (counting the top of the triangle as having m = n = 1) is given by the formula a(n,m) = m^2 + mn + n^2 - 1 \mod (n+m+1).

Notes

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1318727656 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.