2016 is absolutely awesome 18

Algebra Level 5

How many functions f : N N f:\mathbb{N}\rightarrow\mathbb{N} such that:

  • f ( 20160 ) = 1 f(20160) = 1

  • for all x x and y y , f ( x y ) = f ( x ) f ( y ) f(xy) = f(x)f(y)

  • for any n n whose last digit is 3, f ( n ) = 1 f(n) = 1 .

Classification:

  • N = { 0 ; 1 ; 2 ; 3 ; } \mathbb{N}=\{0; 1; 2; 3; \ldots\}

This is a part of the Set .


The answer is 2.

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

Since f 6 ( 2 ) f 2 ( 3 ) f ( 5 ) f ( 7 ) = f ( 20160 ) = 1 f^6(2)f^2(3)f(5)f(7) = f(20160) = 1 we must have f ( 2 ) = f ( 3 ) = f ( 5 ) = f ( 7 ) = 1 f(2) = f(3) = f(5) =f(7) = 1 .

Since f ( 2 ) = f ( 2 × 1 ) = f ( 2 ) f ( 1 ) f(2) = f(2\times 1) = f(2)f(1) we also have f ( 1 ) = 1 f(1) = 1 .

If n n is a positive integer that is not a multiple of 2 or 5 then for some m m , n m nm has last digit 3.

Therefore f ( n ) f ( m ) = f ( n m ) = 1 f(n)f(m) = f(nm) = 1 and hence f ( n ) = 1 f(n) = 1 .

If n = 2 a 5 b n 0 n = 2^a5^bn_0 where n 0 n_0 is not a multiple of 2 or 5 then

f ( n ) = f a ( 2 ) f b ( 5 ) f ( n 0 ) = 1 f(n) = f^a(2)f^b(5)f(n_0) = 1

So f ( n ) f(n) must equal 1 1 for all non-zero n n .

Finally note that f ( 0 ) = f ( 0 ) f ( 0 ) f(0) = f(0)f(0) so f ( 0 ) = 0 f(0) = 0 or f ( 0 ) = 1 f(0) = 1 .

So, there are 2 \boxed{2} functions such that all of above conditions.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...