wu :: forums
« wu :: forums - Centred Hexagonal Numbers »

Welcome, Guest. Please Login or Register.
Nov 25th, 2024, 10:40am

RIDDLES SITE WRITE MATH! Home Home Help Help Search Search Members Members Login Login Register Register
   wu :: forums
   riddles
   medium
(Moderators: ThudnBlunder, SMQ, towr, Eigenray, william wu, Grimbal, Icarus)
   Centred Hexagonal Numbers
« Previous topic | Next topic »
Pages: 1  Reply Reply Notify of replies Notify of replies Send Topic Send Topic Print Print
   Author  Topic: Centred Hexagonal Numbers  (Read 275 times)
ThudnBlunder
wu::riddles Moderator
Uberpuzzler
*****




The dewdrop slides into the shining Sea

   


Gender: male
Posts: 4489
Centred Hexagonal Numbers  
« on: Jul 18th, 2007, 5:51pm »
Quote Quote Modify Modify

Consider an arithmetic progression 1, a, b and a geometric progression 1, c, d, where a,b,c,d are positive integers and a+b = c+d. Prove that every hex number is a possible value of a and that every possible value of a is a hex number.
« Last Edit: Jul 18th, 2007, 6:11pm by ThudnBlunder » IP Logged

THE MEEK SHALL INHERIT THE EARTH.....................................................................er, if that's all right with the rest of you.
Sameer
Uberpuzzler
*****



Pie = pi * e

   


Gender: male
Posts: 1261
Re: Centred Hexagonal Numbers  
« Reply #1 on: Jul 18th, 2007, 9:21pm »
Quote Quote Modify Modify

First part
 

 
a = 1 + 3n(n-1)
b = 2a - 1
a + b = 3a - 1 = 3 + 9n(n-1) - 1 = 2 + 9n(n-1) = (3n-2)(3n-1)
 
c + d = c + c^2 = c(c+1)
 
Thus if c = 3n-2
and d = c^2 = (3n-2)^2
will always give us integers
Thus all hex numbers are possible values for a
 
IP Logged

"Obvious" is the most dangerous word in mathematics.
--Bell, Eric Temple

Proof is an idol before which the mathematician tortures himself.
Sir Arthur Eddington, quoted in Bridges to Infinity
FiBsTeR
Senior Riddler
****





   
WWW

Gender: male
Posts: 581
Re: Centred Hexagonal Numbers  
« Reply #2 on: Jul 20th, 2007, 11:27am »
Quote Quote Modify Modify

And the second:
 
hidden:

Given the arithmetic sequence {1, a, b, ...} and the geometric sequence {1, c, d, ...}, we can rewrite them as {1, a, 2a-1, ...} and {1, c, c2, ...}.
 
Then:
a + b = c + d
a + (2a - 1) = c + (c2)
3a - 1 = c2 + c
3a = c2 + c + 1
 
Since we want to show that a must be in the form 1 + 3n(n-1) = 3n2 - 3n + 1, we have to find some c = pk + q that will produce a = 3n2 - 3n + 1. So let c = pk + q:
 
3a = (pk + q)2 + (pk + q) + 1
3a = p2k2 + 2pqk + q2 + pk + q + 1
a = [ (p2)k2 + (2pq + p)k + (q2 + q + 1) ]/3
 
We want:
p2/3 = 3
(2pq + p)/3 = -3
(q2 + q + 1)/3 = 1
 
A bit of algebra shows that we need p = -3, q = 1.
 
So thus we take c = -3n + 1:
3a = c2 + c + 1
3a = (-3n + 1)2 + (-3n + 1) + 1
3a = 9n2 - 6n + 1 - 3n + 1 + 1
3a = 9n2 - 9n + 3
a = 3n2 - 3n + 1
a = 1 + 3n(n-1)
 
Thus:
If c = 1 (mod 3), then a must be a hexagonal number.
 
If c = 0 (mod 3), then:
3a = (3n)2 + (3n) + 1 = 9n2 + 3n + 1, which is not divisible by 3, and a is thus not an integer, which cannot be.
 
If c = 2 (mod 3), then:
3a = (3n + 2)2 + (3n + 2) + 1 = 9n2 + 12n + 4 + 3n + 2 + 1 = 9n2 + 15n + 7, whichis not divisible by 3, and a is thus not an integer, which cannot be.
 
Therefore c must be congruent to 1 modulo 3, which as shown above implies that a must be a hex number.
« Last Edit: Jul 20th, 2007, 12:03pm by FiBsTeR » IP Logged
Pages: 1  Reply Reply Notify of replies Notify of replies Send Topic Send Topic Print Print

« Previous topic | Next topic »

Powered by YaBB 1 Gold - SP 1.4!
Forum software copyright © 2000-2004 Yet another Bulletin Board