Exponent of 3

3 3 = 27 , 2 + 7 = 9 3 4 = 81 , 8 + 1 = 9 3 10 = 59049 , 5 + 9 + 0 + 4 + 9 = 27 3 15 = 14348907 , 1 + 4 + 3 + 4 + 8 + 9 + 0 + 7 = 36 \begin{array} {l l l } 3^3 = 27, & 2 + 7 &= 9 \\ 3^4 = 81, & 8 + 1 &= 9 \\ 3^{10} = 59049, & 5 + 9 + 0 + 4 + 9 &= 27 \\ 3^{15} = 14348907, & 1 + 4 + 3 + 4 + 8 + 9 + 0 + 7& = 36 \end{array}

True or False?

For any positive integer k > 1 k>1 , the sum of digits of the representation of 3 k 3^k is always divisible by 9.


Inspiration

True False

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.

5 solutions

Chew-Seong Cheong
Jul 20, 2018

Relevant wiki: Divisibility Rules (2,3,5,7,11,13,17,19,...)

Yes , divisibility rules state that a positive integer N N is divisible by 9, if its sum of digits is divisible by 9 (see proof). Since all 3 n 3^n , where n 2 n \ge 2 are divisible by 9, their sums of digits are also divisible by 9.

Proof: Any n n -digit positive integer can be expressed as:

N = k = 0 n 1 1 0 k d k = k = 0 n 1 ( 9 + 1 ) k d k where d k is the k th digit of N . N k = 0 n 1 ( 9 + 1 ) k d k k = 0 n 1 d k (mod 9) \begin{aligned} N & = \sum_{k=0}^{n-1} 10^k d_k = \sum_{k=0}^{n-1} (9+1)^k d_k & \small \color{#3D99F6} \text{where }d_k \text{ is the }k\text{th digit of }N. \\ \implies N & \equiv \sum_{k=0}^{n-1} (9+1)^k d_k \equiv \sum_{k=0}^{n-1} d_k \text{ (mod 9)} \end{aligned}

Note that k = 0 n 1 d k \displaystyle \sum_{k=0}^{n-1} d_k is the sum of digits of N N . Therefore, N N is divisible by 9, if its sum of digits is divisible by 9.

Ram Mohith
Jul 20, 2018

It's simple. Let us take a number 3 k ( k N > 1 ) {\color{#E81990}3^k} \space (k\in \mathbb N > 1)

Now the above number can be expressed as : 3 k = 3 2 × 3 k 2 (or) 3 k = 9 × 3 k 2 \begin{aligned} {\color{#E81990}3^k} = {\color{#20A900}3^2} \times {\color{#3D99F6}3^{k - 2}} \\ \text{(or)} \quad \quad \\ {\color{#E81990}3^k} = {\color{#20A900}9} \times {\color{#3D99F6}3^{k - 2}} \space \space \\ \end{aligned} So, the number 3 k ( k N > 1 ) {\color{#E81990}3^k} \space (k\in \mathbb N > 1) is divisible by 9 \color{#20A900}9 . Now, a number is divisible by 9 \color{#20A900}9 if and only if the sum of digits of that number is also divisible by 9 \color{#20A900}9 . So, the sum of digits of number 3 k ( k N > 1 ) {\color{#E81990}3^k} \space (k\in \mathbb N > 1) is always a multiple of 9 \color{#20A900}9 .

Mary Arans
Sep 5, 2018

Any 3^k (k>1), divides by 9 = 3^2 since k>=2

Piero Sarti
Jul 26, 2018

Quite simply if k 2 k \geq 2 , then we can rewrite 3 k = 9 × 3 s 3^k = 9\times 3^s where k = 2 + s k = 2+s . This means that 3 k 3^k is divisible by 9 9 k 2 \forall k \geq 2 .

Divisibility rule for 9 9 :

If the sum of the digits of n n is divisible by 9 9 then 9 9 divides n n .

Since 9 9 divides 3 k 3^k , 9 9 must also divide the sum of the digits of 3 k 3^k .

Vimay MarCisse
Jul 20, 2018

If the sum of all digits is divisible by 9, that means that the number is divible by 9.

3^2 = 9

And :

    3^k = 3^2 × 3^l 

           = 9 × 3^l

with k > 1 and l an integer

Thus 3^k is always divisible by 9 for any k > 1

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...