TOPICS
Search

Rascal Triangle


The rascal triangle is a number triangle with numbers arranged in staggered rows such that

 a_(n,r)=n(r-n)+1.
(1)

The published study of this triangle seems to have originated relatively recently, having been added to Sloane's Online Encyclopedia of Integer Sequences (OEIS) as recently as 2002--where it was cataloged as [t]riangle with diagonal n congruent to 1 mod (n-1)--and having been the subject of scholarly mathematical publication as recently as 2010 (Anggoro et al. 2010). The triangle is sometimes written without capitalization as the rascal triangle.

One common point of exposition among literature regarding the rascal triangle is its similarity to Pascal's triangle. Indeed, the rascal triangle is topically similar to Pascal's triangle in that the configuration starting with n=0 begins

 1
1  1
(2)

and that the rows afterwards have their first and last entries equal to

 a_(0,r)=0(r-0)+1=1=r(r-r)+1=a_(r,r),
(3)

respectively.

RascalTrianglePascalDiagram

The similarities don't end there, however. One well-known fact about Pascal's triangle is that the interior entries of each row are determined by the so-called inverted triangle formula

 South=East+West
(4)

as shown in the diagram above.

RascalTriangleRascalDiagram

On the other hand, the rows of the rascal triangle have interior entries which are determined by a so-called diamond formula of the form

 South=(East×West+1)÷North,
(5)

whereby one can compute the first few rows of the rascal triangle to have the form

 1
1  1
1  2  1
1  3  3  1
1  4  5  4  1
1  5  7  7  5  1
1  6  9  10  9  6  1
(6)

(OEIS A077028). Surprisingly, each interior entry of the rascal triangle remains integer-valued despite the fact that, as shown in (), every such entry is computed using integer division (Anggoro et al. 2010).

By examining the first few rows of the rascal triangle, one can hypothesize the validity of a number of significant number-theoretic properties thereof. For example, the values given support the claim (OEIS A077028) that each element of the nth diagonal is congruent to 1 modulo (n-1), e.g., in the fourth diagonal, where each of

 1, 4, 7, 10,...
(7)

is congruent to 1 modulo 3. Here, n=1,2,3,.... Moreover, one notices that the nth number on the rth row a_(n,r) appears to be--and is--precisely the nth number on the (r-n)th diagonal (Anggoro et al. 2010) where, here, n,r=1,2,3,... and the 0th row is excluded. This observation is fundamental in proving that the rascal triangle consists strictly of integers.

There are a number of other colorful properties of the rascal triangle. For example, the sums of the rows of the rascal triangle are the so-called cake numbers (OEIS A000125):

1=1
(8)
2=1+1
(9)
4=1+2+1
(10)
8=1+3+3+1
(11)
15=1+4+5+4+1
(12)
26=1+5+7+7+5+1.
(13)

Several other authors have noted interesting connections between numbers in the rascal triangle and various other fields of mathematics including group theory, linear algebra, and geometric analysis.


See also

Number Triangle, Pascal's Triangle

This entry contributed by Christopher Stover

Explore with Wolfram|Alpha

References

Anggoro, A.; Liu, E.; and Tulloch, A. "The Rascal Triangle." College Math. J. 41, 393-395, 2010.Bogomolny, A. "The Rascal Triangle." Interactive Mathematics Miscellany and Puzzles. http://www.cut-the-knot.org/arithmetic/algebra/RascalTriangle.shtml.Sloane, N. J. A. Sequences A077028, A007318, A000125, and A128139 in "The On-Line Encyclopedia of Integer Sequences."

Cite this as:

Stover, Christopher. "Rascal Triangle." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/RascalTriangle.html

Subject classifications