RankRizz
JEE ADVANCED 2026 · PAPER 2+4MEDIUMTRANSCRIBED

JEE Advanced 2026 Mathematics question — Composite functions

Let N\mathbb{N} denote the set of all positive integers. Consider the sets

A={1,2,3,4,5}andB={1,2,3,4,5,6,7}.A=\{1,2,3,4,5\}\quad\text{and}\quad B=\{1,2,3,4,5,6,7\}.

Let SS be the set of all functions f:A→Bf:A\to B such that f(2)≠2f(2)\neq 2 and f(4)≠4f(4)\neq 4. Consider the set

T={f∈S:there exists a function g:B→N such that g(f(x))=2x for all x∈A}.T=\big\{f\in S:\text{there exists a function }g:B\to\mathbb{N}\text{ such that }g\big(f(x)\big)=2^x\text{ for all }x\in A\big\}.

Then the number of elements in the set TT is ___.

SOLUTION

From the condition for all , we can see that if two different values of had the same , then would have to assign the same value to two different powers of 2. This is not possible because each is unique.

Therefore, must be a one-one (injective) function from to .

To find the total number of one-one functions from a set of 5 elements () to a set of 7 elements (), we first choose any 5 elements from 7 and then arrange them. Hence,

Total one-one functions

Now we subtract the functions that do not satisfy the given conditions: and .

Functions where : choose images for remaining 4 elements of from the remaining 6 elements of , and arrange them.

Similarly, functions where are also in number.

Functions where both and : we choose images for the remaining 3 elements from the remaining 5 elements of , and arrange them.

By the principle of inclusion and exclusion:

Required number of functions

Tagged Composite functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.

ChapterFunctions
TopicComposite functions
TypeNumerical answer