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

Home > Numbers
Si fueris Romae (Posted on 2010-02-12) Difficulty: 4 of 5
It is a tricky cryptarithm, but still solvable.

I've solved it, why don't you?


See The Solution Submitted by Ady TZIDON    
Rating: 3.6000 (5 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Hints/Tips I know the trick (spoiler) | Comment 1 of 5
Well, this is an impossible cryptarithm in Base 10 or any other base, because M has to be zero and then U + S = the base but then U + S must = O - 1, which is a contradiction.

I'll bet a lira that I can make this work using Roman numerals.  (Andy certainly left enough hints in that direction).

Gotta do errands, but I'll solve this later, analytically, unless somebody gets to it first.  I'd love to see Charlie try to solve it with a computer program!

Nice puzzle, Andy!

  Posted by Steve Herman on 2010-02-12 15:40:32
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information