The number of bijective functions f : {1, 3, 5, 7,…., 99} {2, 4, 6, 8,…., 100}, such that is
The number of bijective functions f : {1, 3, 5, 7,…., 99} {2, 4, 6, 8,…., 100}, such that is
f : {1, 3, 5, 7, ….,99} {2, 4, 6, 8, …….100}
cases f (3) > f (9) > f (15) ……. > f (99)
from the set {2, 4, 6, …., 100}
17 distinct numbers can be selected in 50C17 ways again remaining {1, 5, 7, 11, ….} can map in 33! ways
total number of such required functions
Similar Questions for you
It's difficult but in some colleges you may can get
is collinear with
⇒ = …(1)
is collinear with
⇒ …(2)
From (1) and (2)
->
and
, put sin3x + cos3x = t(3 sin2x×cosx – 3cos2xsinx) dx = dt
->
Taking an Exam? Selecting a College?
Get authentic answers from experts, students and alumni that you won't find anywhere else.
On Shiksha, get access to
Learn more about...

Maths Inverse Trigonometric Functions 2021
View Exam DetailsMost viewed information
SummaryDidn't find the answer you were looking for?
Search from Shiksha's 1 lakh+ Topics
Ask Current Students, Alumni & our Experts
Have a question related to your career & education?
See what others like you are asking & answering