Congruence Classes modulo 13 13

N N is the number of distinct non-negative integer value(s) of x x with 0 x < 13 0\leq x <13 to the following congruence, and S S is the sum of those distinct positive integer value(s) of x x x 3 n ( m o d 13 ) . x \equiv 3^n \pmod{13}.

Find ( N + S ) (N+S) .


Assumption :

  • n n is a positive integer.


The answer is 16.

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.

1 solution

Emanuele Prati
Apr 18, 2019

In modulo 13 13 , 3 1 3 3^1 \equiv 3 , 3 2 9 3^2 \equiv 9 and 3 3 27 1 3^3 \equiv 27 \equiv 1 , so for each number n n : 3 n 3 3 q × 3 r ( 3 3 ) q × 3 r 1 q × 3 r 3 r 3^n \equiv 3^{3q} \times 3^r \equiv (3^3)^q \times 3^r \equiv 1^q \times 3^r \equiv 3^r , where q q and r r are respectively the quotient and the remainder of the Euclidean division of n n by 3 3 , 0 r 2 0 \le r \le 2 ; this means that 3 n 1 , 3 , 9 3^n \equiv 1, 3, 9 , N = 3 N=3 , S = 13 S=13 and N + S = 16 N+S=\boxed{16}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...