Beruflich Dokumente
Kultur Dokumente
Part of this work contained in this chapter has resulted in the following
publications:
Gopalan, M.A. and Jayakumar, P. "On hexagonal numbers", International
Journal Acta Ciencia Indica, 32M(3) (2006) 1217-1219.
Theorem 4.1.1
There exists an infinite pairs of hexagonal numbers (H„, H^) such
that their ratio is equal to a non-zero square - free integer.
65
Proof
Let (H^,H^)he a pair of hexagonal n u m b e r s s u c h t h a t
H. = a .(4.1.1)
2(m'-~) = 2a(k'-~).
7- 1'
(m—) 2a
4 16 4' 16
16 ^ ^ 16 ^
If we t a k e X= 4 k - 1 , ...(4.1.2)
Y = 4m-1, ...(4.1.3)
t h e n we get
r - a X ^ = l - a = - ( a - l ) = -7V, ...(4.1.4)
•where N = a-l
X„=X,y„+Y,x„, ...(4.1.5)
J«=-[(jo+Vaxo)"^'+(3^o-Vaxo)"^^] ...(4.1.10)
Xn=-^[(yo+^faxo)"^'-{yo-y[axoT^^] ...(4.1.11)
2 - 2v«
...(4.1.12)
Table 4.1.2
s. Values Rankm Rankk Hexagonal numbers H ^ Hexagonal numbers H ^^
No ofn
1 1 116 4 26796 3828
Theorem 4.1.2
The general form of the rank of square hexagonal number
{HJis given by
69
H„ = t 2 , ...(4.1.14)
2[(„-i)^ _ ! , = ,= .
16 16
{Am-\f-\ = %t\
Ifwetakey = 4m-l, ...(4.1.15)
t h e n we get
7 ' - l = 8r^(0r) r ' - 8 / ' = l , ...(4.1.16)
Theorem 4 . 1 . 3
The r a n k mr satisfies the recurrence relation:
mr+2 - 34 mr+i + mr + 8 = 0,
where m ris t h e r a n k s of the r"' square hexagonal n u m b e r s .
Proof
The r a n k s m^of t h e s q u a r e hexagonal n u m b e r H^ are given
by
= (3 + V8)2r+3 + (3_V8)2r+3
= 17[(3+V8)2r+l+(3-V8)2r+l]+6V8[(3+V8)2r+l-(3-V8)2r+l],
...(4.1.19)
8m ,^2-2 = (3 + V8)2(r+2)+l + (3 ._7^)2(r+2)+l
= (3 + V8)2r+5 + (3_78)2r+5.
=---[8mr-2].
8 w,^2 - 2 - 272 w,.^, + 68 = - 8OT,+ 2.
8w,^2-272w,^,+8w, = 2 + 2 - 6 8 = - 6 4 .
8 (m^^2 - 34 m„i + m,) = -64
Dividing by 8, we get m^^^ ~34m,^j +m, +8 = 0.
This is t h e recurrence relation for t h e r a n k s of the s q u a r e
hexagonal n u m b e r s .
72
Observation
A few i n t e r e s t i n g relations a m o n g Hexagonal numbers
Let H„ and T^ denote the hexagonal, and triangular
Recurrence relation 4 . 1 . 1
Hexagonal n u m b e r s satisfies the following recurrence relation
H^^x + H^_^ - 2H^ = 4.
Proof
By t h e s t a n d a r d definition of hexagonal n u m b e r ,
if„=m(2m-l) ...(4.1.21)
= (m-1) ( 2 m - 3 ) , ...(4.1.22)
= m (2m-l) + 2 m - l + 2 m + 2
= //„+4m+l. ...(4.1.24)
= m (2m-l)-(2m-l)-2m + 2
= if„-4m + 3 ...(4.1.25)
Identity 4.1.1
The sum of the hexagonal numbers can be expressed as a
polynomial in s.
Thatis, X ^ . = ^ 7 V ( ^ + 1).
^ 3 ^
Proof
The m"' hexagonal number is given by
//„=m(2m-l).
= ^ ^ [ 2 ( 2 5 + l)-3] = ^ ( 4 . - l )
6 i
= 1^2(^ + 1).
3 s
Hence X / ^ . = % 2 ( ^ + l)-
m=l ^ ^
Identity 4.1.2
The sum of the squares of the hexagonal numbers can be
expressed as a polynomial in s.
= 4 Z w - 4 Zm + Zm
m=l /n=l m=l
= s(s+l)
15 6
= — [ 2 4 / + 6 5 ' - 1 6 ^ + 1]
15
Proof
The m"' hexagonal number is given by
H^ = m(2m -1)
Hence HJ =m\2m-lf.
= ^.^rQ^i j_<=;
w'(8m'+ 6m-12w-l),
(Sm'+em-Um-m')
75
3 ^„2
5(5 + l){6s' +\5s' + 6s -6s' -5-h 1) r (5+ i r (25^+25-1)
=8 •12
42 12
4 . 2 . OCTAGONAL NUMBERS
An octagonal n u m b e r is a figurate n u m b e r s t h a t represents
a n octagon. The octagonal n u m b e r for n is given by t h e formula
0„ =n(3n-2),with n > 0.
The first few octagonal n u m b e r s are: 1, 8, 2 1 , 4 0 , 6 5 , 9 6 , 1 3 3 , 1 7 6 ,
2 2 5 , 280, 3 4 1 , 4 0 8 , 4 8 1 , 560, 6 4 5 , 736, 8 3 3 , 936.
(l-xf
Octagonal n u m b e r s can be formed by placing triangular n u m b e r s
on t h e four sides of a s q u a r e . To p u t it algebraically, the n^h
octagonal n u m b e r is
n-l
«'+4^A:
Theorem 4.2.1
There exists an infinite pairs of octagonal numbers (0„, O^) such
that their ratio is equal to a non-zero square - free integer.
Proof
Let {O^, O4) be a pair of octagonal numbers such that
0„
= a, ...(4.2.1)
O,
where a is a non- zero square-free integer. Using the standard
definition of octagonal numbers, the equation (4.2.1) is written as
m(3m-2) = ak{3k-2).
31('"-^)'-i] = 3a[(i-i)'-^].
Ifv/etakeX = 3 k - l , ...(4.2.2)
Y = 3m-1, ...(4.2.3)
then we get
Y^ -\ = a{X^ -\) = aX^ -a
Y'-aX^=\-a = -{si-\) = -N, ...(4.2.4)
where N -a-l
78
The above equation (4.2.4) is well- known Pell's equation
and it has an infinite number of integral solutions. The general
solutions of the equation (4.2.4) are given by
X„=X,y„+Y,x„, ' ...(4.2.5)
•^ ' 2-\/oc
Y2_2X2= -1.
In view of (4.2.12) and (4.2.13), the ranks of the octagonal
numbers are given by
Table 4.2.1
Y2 - 5X2 = -4.
Theorem 4.2.2
The general form of the rank of square octagonal
number (<9„) is given by
9 9
(3m-1)^^1 = 3?'
Ifwetakey = 4m-l, ...(4.2.15)
then we get
y2-3t2=l. ...(4.2.16)
The above equation (4.2.16) is the well-known Pell's equation.
1 9 225
2 121 43681
3 1681 8473921
4 23409 1643897025
Theorem 4.2.3
The rank m^ satisfies the recurrence relation:
w,^2 ~ 14w,^,+m^+4=0, where m^is the rank of the r""square
octagonal number.
Proof
The ranks m^of the square octagonal number O^ are
given by
...(4.2.19)
6m,,, -2 = (2 + VS) ^(^"2)+i + (2 - V3) ^^'"2)"'
= (2 + V3)2r+5 + (2-V3)2r+5
= 9 7 [( 2 +V3)2r+1 + (2 -V3)2r+1]
+ 5 6 ^ 3 [( 2 +A/3)2r+l - (2-^/3)2r+l]
...(4.2.20)
Multiplying (4.2.19) by 14, subtracting from t h e (4.2.20) a n d u s i n g
(4.2.18), we get
[6m ,,2-2] -14 [6m,^,-2] = - [(2 + V3)2r+i + (2-V3)2r+i]
= - [6m r -2]
Dividing by 6, we get
^r+2 ~14w^^, +m^ +4 = 0.
This is t h e recurrence relation for t h e r a n k s of the s q u a r e
octagonal n u m b e r s .
85
Observation
A few i n t e r e s t i n g relations a m o n g octagonal numbers
Let 0„, Ts a n d Hs denote octagonal, triangular and
Recurrence relation 4 . 2 . 1
The octagonal n u m b e r satisfies the following r e c u r r e n c e
relation
Om+l + Om-l - 20m = 6
Proof
By t h e s t a n d a r d definition of octagonal n u m b e r ,
0„=m(3m-2) ...(4.2.21)
= (m-l)(3m-5), ...(4.2.22)
0„,, =(m + l)[3(m + l ) - 2 ] .
= m (3m.-2) + 3m-2 + 3m + 3
= C>„+6m+l ...(4.2.24)
= m (3m-2)-(3m-2)-3m + 3
= 0„-6m + 5 ...(4.2.25)
Identity 4.2.1
The sum of the octagonal numbers can be expressed as a
polynomial in s.
s s
5(^ + l)(2^ + l) 25(^ + 1)
= 3 ^ m ^ -'2^m =3
m=l m=l
^ ^ [ ( 2 5 + l)-2] = r,(2^-l)
• 2
Identity 4.2.2
The sum of the squares of the octagonal numbers can be
expressed as a polynomial in s.
m^.
m=l m=l m=l
= s{s+l)[—(65'+95^+5-1)-35(5 + 1) + 2 ^ ? ^ i ^ ] .
=—[545^-95'-415+11]
15
Identity 4 . 2 . 3
The s u m of t h e c u b e s of t h e octagonal n u m b e r s can be
expressed a s a polynomial in s.
Proof
The m"" octagonal n u m b e r is given by
0„ = m(3w-2)
s Hence Oj =m\2m-2)\
,5 , i c „ 4 , r „ 3 /:„2
^ ^ ^ ( 5 + l)(6^^ + 15^V,6.y^-65"-.y + l) ^^^^(.^ + 1 ) ^ ( 2 / + 2 ^ - 1 )
42 12
J , ri_2
+ 36 o
30
^ ' 14 2
On simplifying, we get
Theorem 4.3.1
There exists an infinite pairs of heptagonal numbers
(Hm, Hk) such that their ratio is equal to a non-zero square - free
integer.
Proof
Let (H m, H k) be a pair of heptagonal numbers such that
= a, ...(4.3.1)
Hk
—(5m-3) = -K5A;-3).
x„ =_^[(;;„+v^xor'-u-V^^or'] ...(4.3.11)
Using (4.3.10), (4.3.11) in the general solutions of (4.3.4),
we get
2 2va
...(4.3.12)
1 2 72 51 12852 6426
Y2 - 6X2 = _5.
1 1 51 21 6426 1071
Y2 - 7X2 =: .6.
94
In view of (4.3.12) and (4.3.13), the ranks of the heptagonal
numbers are given by
Theorem 4.3.2
The general form of the rank of square heptagonal number
(H m) is given by
Proof
Let Hm be a square heptagonal number. We write
Hm = t2, ...(4.3.14)
—(5OT-3) = / ^
2
^, 2 3/W^ ^ ,
5
By writing complete square, we get
'S\{m-—f—^]-2;^
10 100
(10;.-3)-__^ ,^,
100 100
( 1 0 m - 3 ) ' - 9 = 40?'
If we t a k e Y= 1 0 m - 3 , ...(4.3.15)
t h e n we get
y 2 _ 4 0 t 2 = 9. ...(4.3.16)
Values
Rank m^ Heptagonal number H m
of r
0 6 81
1 8214 168662169
2 11844150 350709705290025
3 17079255654 729252434311108535809
4 24628274808486 1516379800105728351531817761
Theorem 4.3.3
The r a n k m r satisfies t h e recurrence relation:
mr+2 - 1442mr+i + mr + 4 3 2 = 0, where m^is t h e r a n k of t h e
r"' s q u a r e heptagonal n u m b e r .
Proof
The r a n k s m^ of t h e s q u a r e heptagonal n u m b e r H^ a r e given
by
where r = 0, 1, 2...
The above equation (4.3.17) c a n be written a s
20 6 m , - 6 = 3 [(19+ 3V40)2r+i + (19 -3V40)2r+i ] ...(4.3.18)
= 3[(19+3V40)2r+i(721 + 114V40)+(19-3V40)2r+i(721-114V40)]
= 2163[(19 +3V40)2r+i+ (19-3V40)2r+i]
...(4.3.19)
20m^^2-6=3[(19+3 V40) 2('-+2)+]+(i9_3 74^) 2(r+2)+i ]
=3[(19+3V40)2r+S+(19 _37^)2r+5 ]
= 3[(19+3V40)2r+i (1039681+164388V40)
+(19-3V40)2r+i(l039681-164388V40)]
= 3119043[(19+3V40)2r+i+(l9-3V40)2r+i]
...(4.3.20)
Multiplying (4.3.19) by 1442, subtracting from (4.3.20) and
u s i n g (4.3.18), we get
= -[20mr-6].
Proof
By the standard definition of the heptagonal number,
//„=^(5m-3). ...(4.3,21)
= 1 (5m-3) + ^(5m-3) + ^ ( m + l ) .
= H„+5m+l. ...(4.3.24)
From the equation (4.3.22), we get
^„-, = ^ ^ ^ [ ( 5 m - 3 ) - 5 ] .
99
J (5m-3)-l(5m-3)-|{m-l).
/ / „ - 5 m + 4. ...(4.3.25)
^m+i + ^ m - r 2 / / „ = 5
Identity 4 . 3 . 1
The s u m of t h e heptagonal n u m b e r s can be expressed a s a
polynomial in s.
1
That is, i:H„=-Ts{5s-2)., where Ts is t h e 5'*triangular
">=• 3
number.
Proof
The m'^ heptagonal n u m b e r is given by
//„=|(5m-3)
= ^(5^-2)
Hence ! ; / / „ = ^ ( 5 5 - 2 ) .
m=l ^
100
Identity 4.3.2
The sum of the squares of the heptagonal numbers can be
expressed as a polynomial in s.
triangular number.
Proof
The m^ heptagonal number is given by
H^ = ^ (5m -3)
Thus Y.Hj=j:[^(5m-3)r
4 m=l
= -[25j]w'-302]w'+9^m'].
^ m=\ m=l m=l
Identity 4.3.3
The sum of the cubes of the heptagonal numbers can be
expressed as a polynomial in s.
101
S 'T'
Proof
The m"' h e p t a g o n a l n u m b e r is given by
Hence HJ =-w^(5m-3)\
8