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

Home > Numbers
Go 2 Gig, Get Minimum (Posted on 2007-05-25) Difficulty: 3 of 5
Minimize the bases P and Q such that each of the following alphanumeric equations has at least one solution:

(A) (GO)Base P + (GO)Base P = (GIG)Base P

(B) (GO)Base Q*(GO)Base Q = (GIG)Base Q

Note: Solve each of the alphanumeric equations separately and remember G, O and I must be distinct and G can't be zero.

See The Solution Submitted by K Sengupta    
Rating: 4.0000 (2 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re: Analytical Soltuion (more solutions)Gamer2007-05-25 23:41:17
Analytical SoltuionGamer2007-05-25 20:17:23
SolutionQuick Basic solution (pun) -- (spoiler!!!)Charlie2007-05-25 16:32:14
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