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(2): only one Comment 5 of 5 |
(In reply to re: only one by Charlie)

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

 Correct!!

t^2+t+1=0

t^2+t=-1=6 mod 7

 t*( t+1)=6

t=2  or t=4

This is how I have missed  50% of solutions  

Ady


  Posted by Ady TZIDON on 2008-10-07 14:17:30
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 (3)
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