Published by:
CGP EDU Academic Team
Published on: August 14, 2026
The number of strictly increasing functions 
from the set 
to the set 
such that 
for 
, is equal to :
Text Solution
Verified by ExpertsThe correct answer is:
D
For strictly increasing 
, if we choose elements 
, then 
.
Since 
always, condition 
means 
for all 
.
Let 
. Then 
, and 
is non-decreasing.
So 
for all 
.
Number of non-decreasing sequences of length 6 from 
.
──────────────────────────────────────────────────────────────────────────────────────────
Prepare Smarter with CGP Edu
Get practice questions, solutions, and test series in one place.
Write a Review
Share your experience with this question and solution.
Commentary
Send your comment, doubt, correction, or feedback to admin.
Similar Questions
Explore conceptually related problems
The largest , for which divides 101 !, is :
The number of 4 -letter words, with or without meaning, which can be formed using the letters PQRPQ…
Three persons enter in a lift at the ground floor. The lift will go upto floor. The number of ways…
The largest value of , for which divides , is
The letters of the word "UDAYPUR" are written in all possible ways with or without meaning and thes…
Let ABC be a triangle. Consider four points on the side AB , five points on the side , and four …