Let a function be defined as .
If satisfies for all , then the number of such functions and the probability of selecting a bijective function is .
Given that can be expressed as , where and are coprime positive integers, find .
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.
The only bijective function f : A = { 1 , 2 , 3 , 4 } → A = { 1 , 2 , 3 , 4 } such that f ( f ( x ) = f ( x ) , ∀ x ∈ A is the identity function in A , ( f = I d A ) ,because if f = I d A then ∃ x ∈ A such that f ( x ) = x and then f ( f ( x ) ) = f ( x ) ⇒ that function is not bijective. So N = M 1 ⇒ M + N = M M 2 + 1 = Q P due to gcd ( M 2 + 1 , M ) = 1 because − M ⋅ M + M 2 + 1 = 1 and hence P m o d Q = 1
Note .- M = 1