Subcontests
(20)d(n), d(d(n)), d(d(d(n))), ... , sum of digits , limit
For every n∈N, let d(n) denote the sum of digits of n. It is easy to see that the sequence d(n),d(d(n)), d(d(d(n))),... will eventually become a constant integer between 1 and 9 (both inclusive). This number is called the digital root of n . Denote it by b(n). Then for how many natural numbers k<1000,limn→∞b(kn) exists. g:R^4-->R F.E. in 6 var
The number of functions g:R4→R such that, ∀a,b,c,d,e,f∈R :(i) g(1,0,0,1)=1
(ii) g(ea,b,ec,d)=eg(a,b,c,d)
(iii) g(a+e,b,c+f,d)=g(a,b,c,d)+g(e,b,f,d)
(iv) g(a,b,c,d)+g(b,a,d,c)=0is :(A)1
(B)0
(C)infinitely many
(D)None of these[Hide=Hint(given in question)]
Think of matrices Number of involutions
Find the number of f:{1,…,5}→{1,…,5} such that f(f(x))=x(A)26
(B)41
(C)120
(D)60