Let be the set of all primes which cannot be expressed as , . Let be a random relation mapping from to itself. The probability that the relation maps all the elements in the domain to all the elements in the co domain is given by , where and . Find
Details:
The relation is bijective.
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.
Let p be a prime greater than 3 . Clearly, p ≡ 0 , 2 , 4 ( m o d 6 ) because it would be even, and p ≡ 3 ( m o d 6 ) because it would be divisible by 3 . Therefore, p ≡ 1 , 5 ( m o d 6 ) , meaning it can be expressed in the form 6 k ± 1 for some k ∈ N .
Hence the set A is simply { 2 , 3 } . There are 2 ⋅ 2 = 4 mappings in total, but only two of these satisfy the condition: { 2 , 3 } → { 2 , 3 } and { 2 , 3 } → { 3 , 2 } . Hence the answer is 4 2 = 2 1 ⟹ a + b = 3 .