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

Home > Numbers
Pandigital and Pretty Powerful III (Posted on 2009-05-12) Difficulty: 2 of 5
Determine all possible triplet(s) (P, Q, N) of positive integers, with P < Q and N ≥ 3, such that the decimal representations of PN and QN will together contain each of the digits 0 to 9 exactly once. Neither PN nor QN can contain any leading zero.

See The Solution Submitted by K Sengupta    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: computer solution | Comment 3 of 4 |
(In reply to computer solution by Daniel)

I see Daniel has expanded the range I used, and shows no other solutions possible.  I do not know how Mathematica works, and I see an assignment n=3, but then also "n++" which I assume tests higher exponents in the same (p,q) loops, until values exceed ten digits (the "T10"?). I also tried n=4 and 5, and found quite a few pandigital(1..9) but none (0..9).  That is a powerful package, but what a syntax!  Nice proof!

 


  Posted by ed bottemiller on 2009-05-12 14:27:12
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 (14)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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