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

Home > Just Math
Testy Triplet Treat (Posted on 2013-08-04) Difficulty: 3 of 5
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: ( You must be logged in to post comments.)
  Subject Author Date
re(2): results so far, but no proof in sightCharlie2013-08-06 10:07:34
Some Thoughtsre(2): results so far, but no proof in sightAdy TZIDON2013-08-05 11:09:33
re: results so far, but no proof in sightCharlie2013-08-05 09:50:41
re(3): results so far, but no proof in sightDaniel2013-08-04 15:42:58
Some Thoughtsre(2): results so far, but no proof in sightAdy TZIDON2013-08-04 15:25:36
re: results so far, but no proof in sightCharlie2013-08-04 12:55:17
Some Thoughtsresults so far, but no proof in sightCharlie2013-08-04 12:53:46
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 (5)
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