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

Home > Numbers
Sum, Times, I Wonder..(3) (Posted on 2011-08-27) Difficulty: 3 of 5
Each of the small letters in bold represents a different nonzero base n digit from 1 to n-1 to satisfy this cryptarithmetic equation.

a.b + c.d = (a.b)*(c.d)

Determine all possible positive integer values of n ≤ 36 such that:

(I) The above equation has at least two valid solutions.

(II) a+b+c+d is a perfect square.

Notes:

(A) Solve parts (I) and (II) separately.

(B) Adjacent numerals are multi-digit base n numbers, and not the product. For example, if n = 36, a=1, b=2, c=3 and d=4, then a.b represents the base-36 number 1.2 and, c.d represents the base 36 number 3.4.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionsolutionJustin2011-10-22 14:15:50
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 (8)
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