Algorithms for Ternary Number System

Numbers are counted in twos by machines, and in tens by men. However, there are countably infinite numbers of ways of counting numbers, in general. It has been shown that for optimum number of computations in counting a number, the base-e number system is the most preferred. Since the number 3 is the integer nearest to e, we focus on a number system with base 3. In this paper, we discuss a few important existing algorithms and propose related novel algorithms for some fundamental computations.