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

Home > Numbers
Near Goldbach Alphametics (Posted on 2009-06-10) Difficulty: 3 of 5
In the following alphametic equation each capital letter in bold represents a different base x digit from 0 to x-1. None of the numbers can contain any leading zero.

                        PRIME + PRIME + PRIME = NUMBER

Determine the minimum positive integer value of x such that PRIME is a prime number.

Bonus Question:

What would have been the minimum positive integer value of x, if each capital letter in bold represented a different base x prime digit from 2 to x-1?

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
program for part 2Charlie2009-06-11 16:03:12
part 1 solutionCharlie2009-06-10 18:55:21
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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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