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

Home > Just Math
Getting the bases with aabbcc (Posted on 2008-10-07) Difficulty: 3 of 5
Determine all possible positive integer base(s) T such that:

(111)T = (aabbcc)6, where each of a, b and c denotes a different base 6 digit from 0 to 5 and, a is not zero.

Note: Try to solve this problem analytically, although computer program/ spreadsheet solutions are welcome.

See The Solution Submitted by K Sengupta    
Rating: 2.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: only one | Comment 3 of 5 |
(In reply to only one by Ady TZIDON)

T need not be 2 mod 7 in order for T^2 + T + 1 to be a multiple of 7.

T mod 7     T^2 + T + 1  mod 7
0                      1
1                      3
2                      0
3                      6
4                      0
5                      3
6                      1

  Posted by Charlie on 2008-10-07 13:13:20
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 (2)
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