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

Home > Numbers
Sum, Times, I Wonder..(2) (Posted on 2011-04-02) Difficulty: 2 of 5
Each of the small letters in bold represents a different base 36 digit from 0 to Z to satisfy this cryptarithmetic equation. None of the numbers can contain any leading zero.

ab.c + b.cd = (ab.c)*(b.cd)

Prove that abc is always divisible by bcd.

Note: Adjacent numerals are multi-digit base 36 numbers, and not the product. For example, if a=1, b=2, c=3 and d=4, then b.cd represents the base-36 number 2.34 and, a.bc represents the base 36 number 1.23.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionSolutionDej Mar2011-04-02 11:31: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 (9)
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