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

 Testy Triplet Treat (Posted on 2013-08-04)
P(N) denotes the product of the digits in the base ten representation of N.

Determine all possible triplets (A,B,C) of positive integers with A ≤ B ≤ C that satisfy this system of equations:

A = P(B)+ P(C), B = P(A) + P(C), and C = P(A) + P(B)

Prove that there are no others.

 No Solution Yet Submitted by K Sengupta No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: results so far, but no proof in sight | Comment 2 of 7 |
(In reply to results so far, but no proof in sight by Charlie)

BTW, the only thought I had on a proof would be to check all possibilities up to a certain total, but the only way to make that total work would be to have it really high, like a 12-digit number.
 Posted by Charlie on 2013-08-04 12:55:17

 Search: Search body:
Forums (0)
Random Problem
Site Statistics
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox: