Balanced

Ternary Expansion

It

can be shown that every integer can be uniquely represented in the form

where e $j=-1,0,$ or $1$ for $j=0,1,2$

$ek3k+ek-13k-1+$dots$+e13+e0,$

where $ej=-1,0,or1$ for $j=0,1,2,$dots,$k$

lol

k$.$ Ex

ansion $s$ of his type are called balanced ternary expansions.

So the number $(-101)btn=(-1**3^2+0**3^1+1**3^0),10=(-9+0+1)=(-8)10$

Write an algorithm to add two balanced ternary numbers$($avoid using the decimal$)?$ And show that through an example