All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Hexagonal Palindrome (Posted on 2013-11-26) Difficulty: 2 of 5
Determine the minimum value of a hexagonal number H(p) = 2p2 - p, such that each of p and H(p) is a base ten palindrome.

*** p must have more than one digit, so trivial solutions like p=0,1 are not valid.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Solutioncomputer solutionCharlie2013-11-26 19:42:25
No SubjectBenny2013-11-26 15:00:23
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information