Home > Numbers
| Go 2 Gig, Get Minimum (Posted on 2007-05-25) |
 |
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.
|
|
Submitted by K Sengupta
|
|
Rating: 4.0000 (2 votes)
|
|
|
Solution:
|
(Hide)
|
(A) The minimum value of P is 3 such that (12)3 + (12)3 = (101)3 for (G, O, I) = (1, 2, 0)
(B) The required minimum value of Q is 8 such that (13)8*(13)8=171, for (G, O, I) = (1, 3, 7)
EXPLANATION:
*** An analytical solution to the problem has been posted by Gamer here and here.
*** For an alternate methodology, refer to the Quick Basic solution posted by Charlie in this location which also gives all possible values of Q for 1 ≤ Q ≤ 99.
|
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (1)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|
