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

Home > Algorithms
Ternary Multiplication Algorithm (Posted on 2023-03-24) Difficulty: 3 of 5
Provide an algorithm to multiply a series of Base 3 integers, represented as strings, without converting to any other base during any part of the algorithm. Each string (Base 3 integer) may have an arbitrary number of digits.

You may not use arithmetic operations on the digits in a way that is equivalent to changing the base, although you may use a dictionary or table lookup to recognize, for example, that in Base 3, 2*2 = 11.

You can use any programming language, or pseudo-code, or provide a verbal description.

No Solution Yet Submitted by Larry    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsPossible solutionPaul2023-03-27 14:04:19
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 (9)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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