729
59,048
3281
1094
512

**
This section requires Javascript.
**

You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.

For every representation of $a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0$ . that equals a positive number $x$ . There is always a representation that equals $-x$ . Just times our initial representation of $a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0$ that equals positive number x by -1. Thus, #(positive representations) = #(negative representations). Since each $a_i$ can have 3 choices of numbers.The answer is $((3^8-1)/2) + 1$