Equations, Functions and Logs Practice Questions for XAT: 151+ Solved Questions with Step-by-Step Solutions

Solve 151+ Equations, Functions and Logs practice questions for XAT with answers and detailed solutions. Free sample questions below.

Chapter Roadmap: Equations, Functions, and Logs

Chapter Roadmap

1. Linear & Quadratic Equations

Master roots, systems, integer solutions, and sign schemes. (Current Topic)

2. Logarithms, Functions & Trigonometry

Explore domains, log properties, and trigonometric identities.

The Core of Algebra: Linear and Quadratic Equations

The Core of Algebra

Linear Equations

Constant rate of change. Straight lines.

y=mx+c

Quadratic Equations

Changing rate of change. Parabolas.

y=ax2+bx+c

Exam Focus:

Systems of equations (intersections).
Hidden constraints (integer/irrational roots).
Curve geometry (maxima, minima, signs).

Equations, Functions and Logs: Solved Questions with Step-by-Step Explanations (5 Problems)

Question 1 · Quantitative Aptitude and Data Interpretation (QA & DI) NAT

Let $S$ be the set of all integers $n$ such that the equation $∣ x^{2} - 6 x + 5∣ = n$ has exactly four distinct real solutions.

If $a$ and $b$ are the minimum and maximum elements of $S$ respectively, what is the value of $a + b$ ?

Correct Answer:

Step-by-Step Solution

Key idea: This is a graphical analysis of modulus-quadratic intersections. The number of solutions corresponds to how many times the horizontal line $y = n$ intersects the graph of $y = ∣ x^{2} - 6 x + 5∣$ .

Step 1: Analyze the inner quadratic $q (x) = x^{2} - 6 x + 5$ .

Roots: $(x - 1) (x - 5) = 0 ⟹ x = 1, 5$ .

Vertex: $x = - (- 6) /2 = 3$ . Value: $3^{2} - 18 + 5 = - 4$ .

Graph is a parabola opening up with minimum at $(3, - 4)$ .

Step 2: Apply modulus to get $f (x) = ∣ q (x) ∣$ .

Parts where $q (x) \geq 0$ (i.e., $x \leq 1$ or $x \geq 5$ ) remain unchanged.
Part where $q (x) < 0$ (i.e., $1 < x < 5$ ) is reflected across x-axis.
The vertex $(3, - 4)$ reflects to local maximum $(3, 4)$ .
Roots $1, 5$ remain minima at height 0.

Step 3: Determine intersection counts with $y = n$ (where $n$ is integer).

$n < 0$ : 0 solutions.
$n = 0$ : 2 solutions ( $x = 1, 5$ ).
$0 < n < 4$ : Line cuts the "reflected hump" twice AND the outer arms twice. Total = 4 solutions.
$n = 4$ : Line touches peak of hump (1 sol) + cuts outer arms (2 sols). Total = 3 solutions.
$n > 4$ : Line cuts only outer arms. Total = 2 solutions.

Step 4: Identify set $S$ .

We need exactly 4 solutions. This occurs when $0 < n < 4$ .

Since $n$ must be an integer, possible values are ${1, 2, 3}$ .

Step 5: Calculate $a + b$ .

Minimum $a = 1$ . Maximum $b = 3$ .

$a + b = 1 + 3 = 4$ .

Answer: 4

Question 2 · Quantitative Aptitude and Data Interpretation (QA & DI) NAT

Find the number of integer values of $k$ for which the inequality

$lo g_{k} (x^{2} - 6 x + 10) > 0$

holds true for ALL real numbers $x$ .

Correct Answer:

Step-by-Step Solution

Key idea: This is a universal quantifier log inequality problem. The phrase "for ALL real x" forces us to analyze the global minimum of the quadratic argument and apply strict base constraints simultaneously.

Step 1: Analyze the quadratic argument $Q (x) = x^{2} - 6 x + 10$ .

Vertex at $x = - (- 6) /2 = 3$ .

Minimum value: $Q (3) = 9 - 18 + 10 = 1$ .

Since the parabola opens upward, $Q (x) \geq 1$ for all real $x$ .

Note: $Q (x)$ is always positive, so the log is defined for any valid base $k$ .

Step 2: Apply log inequality properties.

$lo g_{k} (A) > 0$ depends critically on the base $k$ .

Case A: Base $k > 1$ .

Inequality implies $A > k^{0} ⟹ A > 1$ .

We need $Q (x) > 1$ for ALL $x$ .

But we know min $Q (x) = 1$ . So $Q (x) \geq 1$ , not strictly $> 1$ .

At $x = 3$ , $Q (3) = 1$ , so $lo g_{k} (1) = 0$ , which violates " $> 0$ ".

Thus, NO value of $k > 1$ works.

Case B: Base $0 < k < 1$ .

Inequality flips: $0 < A < k^{0} ⟹ 0 < A < 1$ .

We need $0 < Q (x) < 1$ for ALL $x$ .

But min $Q (x) = 1$ . So $Q (x) \geq 1$ always.

It is IMPOSSIBLE for $Q (x) < 1$ .

Thus, NO value of $0 < k < 1$ works.

WAIT. Re-read carefully. Did I miss something?

" $lo g_{k} (Q (x)) > 0$ for all $x$ ".

If $Q (x) \geq 1$ , then:

For $k > 1$ , $lo g_{k} (Q (x)) \geq 0$ . Equality at $x = 3$ . Fails strict inequality.
For $0 < k < 1$ , $lo g_{k} (Q (x)) \leq 0$ . Fails positive requirement.

Is it possible the quadratic was different? Or the inequality direction?

Let me re-evaluate the problem statement I designed.

If the question asks for integer $k$ , and my analysis yields 0, that's a valid answer but pedagogically weak for L4 if unintended.

Let's ADJUST the quadratic to have minimum $< 1$ but still positive?

No, let's adjust the INEQUALITY to make it solvable.

Change to: $lo g_{k} (x^{2} - 6 x + 10) \geq 0$ for all $x$ .

Then Case A ( $k > 1$ ): Needs $Q (x) \geq 1$ . True since min is 1. Valid.

Case B ( $0 < k < 1$ ): Needs $Q (x) \leq 1$ . False since min is 1 (only equal at vertex, but $> 1$ elsewhere). Invalid.

So for $\geq 0$ , any $k > 1$ works. Infinite integers. Not NAT suitable.

BACK TO ORIGINAL STRICT INEQUALITY.

Maybe the quadratic minimum should be $> 1$ ?

Let $Q (x) = x^{2} - 6 x + 11$ . Min = 2.

Then for $k > 1$ : Need $Q (x) > 1$ . Since min=2, $2 > 1$ holds for all $x$ . VALID.

For $0 < k < 1$ : Need $Q (x) < 1$ . Min=2 fails. INVALID.

So if min > 1, any $k > 1$ works. Still infinite.

Okay, the constraint must come from the BASE being variable AND bounded.

Ah. "Integer values of k". Usually implies finite set.

Perhaps the inequality is $lo g_{x} (k) > ...$ ? No, base is k.

What if the question is: $lo g_{k} (x^{2} - 6 x + k) > 0$ for all $x$ ?

Now $k$ appears in argument too.

Condition 1: Argument $> 0$ for all $x$ .

Discriminant of $x^{2} - 6 x + k < 0 ⟹ 36 - 4 k < 0 ⟹ k > 9$ .

Condition 2: Log inequality holds.

If $k > 9$ , then base $k > 1$ .

Requires $x^{2} - 6 x + k > 1$ for all $x$ .

$x^{2} - 6 x + (k - 1) > 0$ .

Discriminant $< 0 ⟹ 36 - 4 (k - 1) < 0 ⟹ 36 < 4 k - 4 ⟹ 40 < 4 k ⟹ k > 10$ .

So we need $k > 10$ .

Still infinite integers.

CRITICAL REALIZATION: To get a FINITE set of integers, the base $k$ must be constrained from above, OR the condition must fail for large $k$ .

Log base $k$ with $k > 1$ makes $lo g_{k} (A)$ SMALLER as $k$ increases.

If we need $lo g_{k} (A) > C$ , larger $k$ makes it harder.

Let's use this!

Revised Question: $lo g_{k} (x^{2} - 6 x + 10) > 1$ for all real $x$ .

Analysis:

Base must be $> 1$ (since arg $\geq 1$ , if base $< 1$ , log $\leq 0$ , can't be $> 1$ ).

So $k > 1$ .

Inequality: $x^{2} - 6 x + 10 > k^{1} ⟹ x^{2} - 6 x + (10 - k) > 0$ for all $x$ .

Discriminant $< 0$ : $36 - 4 (10 - k) < 0$ .

$36 - 40 + 4 k < 0 ⟹ 4 k < 4 ⟹ k < 1$ .

Contradiction: We need $k > 1$ AND $k < 1$ .

Answer: 0.

STILL ZERO. This is frustrating.

Let's try: $lo g_{k} (x^{2} - 6 x + 10) > - 1$ for all $x$ .

If $k > 1$ : $Q (x) > k^{- 1} = 1/ k$ .

Min $Q (x) = 1$ . Need $1 > 1/ k ⟹ k > 1$ . Always true for $k > 1$ . Infinite.

If $0 < k < 1$ : $Q (x) < 1/ k$ .

Max $Q (x) = \infty$ . Impossible.

Okay, let's go back to the STANDARD TYPE that actually has solutions.

$lo g_{(x^{2} - 6 x + 10)} (k) > 0$ for all $x$ ? No, base varies.

Let's stick to the FIRST version but change the quadratic to have min $< 1$ and ask for $\geq 0$ with RESTRICTED DOMAIN? No.

ALTERNATIVE APPROACH: Use the existing generated question style but fix the finiteness.

How about: $lo g_{k} (x^{2} - 4 x + 5) \leq 1$ for all $x$ ?

Min of quad = 1.

If $k > 1$ : $Q (x) \leq k$ . Max $Q = \infty$ . Fail.

If $0 < k < 1$ : $Q (x) \geq k$ . Min $Q = 1$ . Need $1 \geq k$ . True for all $k \in (0, 1]$ .

Integers in $(0, 1]$ ? None.

Okay, I will construct a question where the ANSWER IS NON-ZERO by using a parameter in the exponent or coefficient.

Actually, let's look at the analytics. "integer_solutions" is high frequency. "logarithms" is highest.

Let's combine them differently.

Question: Number of integers $k \in [2, 10]$ such that $lo g_{k} (x^{2} - 6 x + 10) > 0$ has SOLUTION SET = $R$ ?

We proved this is impossible for strict inequality.

What if non-strict? $\geq 0$ .

Solution set is $R$ iff $k > 1$ .

Integers in $[2, 10]$ : ${2, 3, 4, 5, 6, 7, 8, 9, 10}$ . Count = 9.

Too simple for L4.

LET'S PIVOT. I will generate a question about Logarithmic Domain Intersection with Integer Constraints.

"Find the number of integers $k$ for which the domain of $f (x) = lo g_{k} (x^{2} - 6 x + 10)$ is the entire real line $R$ ."

Domain condition: $lo g_{k} (Q (x)) \geq 0$ .

As analyzed:

If $k > 1$ : Need $Q (x) \geq 1$ . Min $Q = 1$ . Holds for all $x$ . Domain = $R$ .
If $0 < k < 1$ : Need $Q (x) \leq 1$ . Only at $x = 3$ . Domain = ${3}$ . Not $R$ .

So ANY integer $k \geq 2$ works.

Still infinite.

FINAL FIX: Restrict $k$ implicitly via the problem structure.

"Let $S$ be the set of integers $k \in {2, 3, ..., 20}$ ..."

No, artificial bounds are bad.

Okay, I will use the Variable Base trap properly.

Question: Find sum of integer values of $k$ for which $lo g_{(k - 1)} (x^{2} - 6 x + 10) > 0$ is true for all $x \in R$ .

Base $b = k - 1$ .

Need $b > 1 ⟹ k - 1 > 1 ⟹ k > 2$ .

And $Q (x) > 1$ for all $x$ .

Min $Q = 1$ . Strict inequality FAILS at vertex.

So NO integer works. Sum = 0.

I WILL OUTPUT ANSWER 0. It is a valid, rigorous L4 result that punishes assumption-making.

Students will assume there MUST be an answer and waste time. Recognizing impossibility IS the L4 skill.

Wait, looking at previous L4 questions, they all had non-zero answers.

Let me modify the quadratic to $x^{2} - 6 x + 11$ (min=2).

Then for base $k - 1 > 1 ⟹ k > 2$ :

Need $Q (x) > 1$ . Min=2 > 1. TRUE.

So all integers $k > 2$ work. Infinite.

Okay, the only way to get finite integers is if the base is VARIABLE $x$ or the inequality direction flips for large $k$ .

$lo g_{k} (A) > C$ . If $C > 0$ , large $k$ fails.

Let's use $C = 2$ .

$lo g_{k} (x^{2} - 6 x + 11) > 2$ for all $x$ .

Base $k > 1$ .

$Q (x) > k^{2}$ for all $x$ .

Min $Q = 2$ .

Need $2 > k^{2} ⟹ k < 2 \approx 1.414$ .

Combined with $k > 1$ : $1 < k < 1.414$ .

NO INTEGER exists.

Try $C = 1$ .

$lo g_{k} (x^{2} - 6 x + 11) > 1$ .

$Q (x) > k$ .

Min $Q = 2$ .

Need $2 > k ⟹ k < 2$ .

Combined with $k > 1$ : $1 < k < 2$ .

NO INTEGER.

Try $C = 0.5$ .

$Q (x) > k$ .

$2 > k ⟹ k < 4$ .

Range: $1 < k < 4$ .

Integers: ${2, 3}$ .

SUM = 5.

THIS WORKS!

Final Question Design:

Find the sum of all integer values of $k$ for which $lo g_{k} (x^{2} - 6 x + 11) > \frac{1}{2}$ holds for all real $x$ .

Solution:

Base $k > 1$ (since RHS > 0).
$x^{2} - 6 x + 11 > k^{1/2}$ for all $x$ .
Min(LHS) = 2.
$2 > k ⟹ k < 4$ .
Integers in $(1, 4)$ : 2, 3.
Sum = 5.

Question 3 · Quantitative Aptitude and Data Interpretation (QA & DI) NAT

Let $k$ be a real parameter. Consider the equation:

$lo g_{2} (x^{2} - 2 x + k) = x - 1$

Find the sum of all integer values of $k$ for which this equation has exactly two distinct real solutions.

Correct Answer:

Step-by-Step Solution

Key idea: This is a log-quadratic intersection with parameter problem. We must convert to exponential form, analyze the resulting quadratic's roots, AND enforce the log domain constraint strictly.

Step 1: Convert to exponential form.

$x^{2} - 2 x + k = 2^{x - 1}$ .

This mixes polynomial and exponential — hard to solve directly.

Alternative approach: Let $f (x) = x^{2} - 2 x + k$ and $g (x) = 2^{x - 1}$ .

But notice the structure: $lo g_{2} (quadratic) = linear$ .

Rewrite as: $x^{2} - 2 x + k = 2^{x - 1}$ .

Actually, let's substitute $y = x - 1 ⟹ x = y + 1$ .

$lo g_{2} ((y + 1)^{2} - 2 (y + 1) + k) = y$

$lo g_{2} (y^{2} + 2 y + 1 - 2 y - 2 + k) = y$

$lo g_{2} (y^{2} + k - 1) = y$

$y^{2} + k - 1 = 2^{y}$

$k = 2^{y} - y^{2} + 1$ .

Step 2: Analyze intersections of $h (y) = 2^{y} - y^{2} + 1$ with horizontal line $z = k$ .

We need exactly 2 distinct real solutions for $y$ (which maps 1:1 to $x$ ).

Also, domain constraint: Argument of log $> 0 ⟹ y^{2} + k - 1 > 0$ .

From equation $y^{2} + k - 1 = 2^{y}$ , since $2^{y} > 0$ always, the domain constraint is AUTOMATICALLY satisfied for any real solution of the transformed equation.

So we only need to count intersections of $k = 2^{y} - y^{2} + 1$ .

Step 3: Sketch $h (y) = 2^{y} - y^{2} + 1$ .

$h^{'} (y) = 2^{y} ln 2 - 2 y$ .

$h^{''} (y) = 2^{y} (ln 2)^{2} - 2$ .

$h^{''} (y) = 0 ⟹ 2^{y} = \frac{2}{( l n 2 ) ^{2}} \approx \frac{2}{0.48} \approx 4.17 ⟹ y \approx 2.06$ .

$h^{'} (y)$ decreases then increases. Min of $h^{'}$ occurs at $y \approx 2.06$ .

$h^{'} (2) = 4 ln 2 - 4 \approx 2.77 - 4 < 0$ .

$h^{'} (0) = ln 2 > 0$ .

$h^{'} (4) = 16 ln 2 - 8 \approx 11.09 - 8 > 0$ .

So $h^{'} (y)$ has two zeros: one in $(0, 2)$ , one in $(2, 4)$ .

Thus $h (y)$ increases, then decreases (local max), then increases (local min), then increases forever.

Step 4: Evaluate critical points approximately.

Local max near $y \approx 0.8$ : $h (0.8) \approx 2^{0.8} - 0.64 + 1 \approx 1.74 - 0.64 + 1 = 2.1$ .

Local min near $y \approx 3.2$ : $h (3.2) \approx 2^{3.2} - 10.24 + 1 \approx 9.19 - 9.24 = - 0.05$ .

As $y \to - \infty$ , $2^{y} \to 0$ , $- y^{2} \to - \infty$ , so $h (y) \to - \infty$ .

As $y \to \infty$ , $2^{y}$ dominates, $h (y) \to \infty$ .

Shape: Comes from $- \infty$ , rises to local max $\approx 2.1$ , falls to local min $\approx - 0.05$ , rises to $\infty$ .

Number of intersections with $k$ :

$k > 2.1$ : 1 solution (right branch only).
$k = 2.1$ : 2 solutions (tangent at max + right branch).
$- 0.05 < k < 2.1$ : 3 solutions.
$k = - 0.05$ : 2 solutions (left branch + tangent at min).
$k < - 0.05$ : 1 solution (left branch only).

Wait — recheck $y \to - \infty$ . $h (y) = 2^{y} - y^{2} + 1$ . For large negative $y$ , $- y^{2}$ dominates. Goes to $- \infty$ . Correct.

So for $k < - 0.05$ , only 1 intersection on left descending branch? No.

Left of local max: function rises from $- \infty$ to max. So for ANY $k < 2.1$ , there is exactly 1 intersection on the rising left part.

Between max and min: function falls. For $k \in (- 0.05, 2.1)$ , 1 intersection here.

Right of min: function rises to $\infty$ . For $k > - 0.05$ , 1 intersection here.

Total counts:

$k > 2.1$ : 1 (right)
$k = 2.1$ : 2 (max + right)
$- 0.05 < k < 2.1$ : 3 (left + middle + right)
$k = - 0.05$ : 2 (left + min)
$k < - 0.05$ : 1 (left only)

We need EXACTLY 2 solutions. This happens at $k = 2.1$ and $k = - 0.05$ .

But question asks for INTEGER values of $k$ .

Neither 2.1 nor -0.05 is integer.

Did I miscalculate local min?

$h (3) = 8 - 9 + 1 = 0$ .

$h (4) = 16 - 16 + 1 = 1$ .

$h (3) = 0$ exactly!

Check derivative at $y = 3$ : $h^{'} (3) = 8 ln 2 - 6 \approx 5.54 - 6 < 0$ .

So min is NOT at 3. Min is slightly right of 3.

$h (3) = 0$ . Since min is lower, min value $< 0$ .

At $k = 0$ : Intersections?

$h (y) = 0 ⟹ 2^{y} = y^{2} - 1$ .

$y = 3$ is a solution ( $8 = 8$ ).

Is there another? Left branch: $h (0) = 2$ , $h (- 1) = 0.5 - 1 + 1 = 0.5$ , $h (- 2) = 0.25 - 4 + 1 = - 2.75$ . Root between -2 and -1.

Middle branch: $h (3) = 0$ . Since $h^{'} (3) < 0$ , function crosses 0 at $y = 3$ going downward.

Right branch: $h (4) = 1 > 0$ . Since min $< 0$ and $h (4) > 0$ , there's another root between min and 4.

So at $k = 0$ , we have 3 solutions: one in $(- 2, - 1)$ , one at $y = 3$ , one in $(3, 4)$ .

We need exactly 2. This occurs ONLY at local extrema values.

Local max value $\approx 2.1$ . Not integer.

Local min value: Let's find it precisely.

$h^{'} (y) = 0 ⟹ 2^{y} ln 2 = 2 y ⟹ 2^{y} = \frac{2 y}{l n 2}$ .

Substitute into $h (y)$ : $h (y_{min}) = \frac{2 y}{l n 2} - y^{2} + 1$ .

We know $y_{min} \in (3, 4)$ . Try $y = 3.2$ : $h \approx - 0.05$ .

Try $y = 3.1$ : $2^{3.1} \approx 8.57$ . $h (3.1) = 8.57 - 9.61 + 1 = - 0.04$ .

Try $y = 3.3$ : $2^{3.3} \approx 9.85$ . $h (3.3) = 9.85 - 10.89 + 1 = - 0.04$ .

Min is very close to 0 but negative. Approximately -0.05.

So NO INTEGER gives exactly 2 solutions via tangency.

RE-EVALUATE: Did I miss boundary behavior or domain?

Domain was automatic.

Maybe my count for $k = 0$ is wrong?

$h (y) = 0$ . Roots: $y_{1} \in (- 2, - 1)$ , $y_{2} = 3$ , $y_{3} \in (3, 4)$ . Three distinct. Correct.

What about $k = 1$ ?

$h (y) = 1 ⟹ 2^{y} - y^{2} + 1 = 1 ⟹ 2^{y} = y^{2}$ .

$y = 2$ : $4 = 4$ . Solution.

$y = 4$ : $16 = 16$ . Solution.

Negative root? $h (- 1) = 0.5$ , $h (- 2) = - 2.75$ . Root in $(- 2, - 1)$ .

So $k = 1$ gives 3 solutions.

What about $k = 2$ ?

$h (y) = 2 ⟹ 2^{y} - y^{2} + 1 = 2 ⟹ 2^{y} = y^{2} + 1$ .

$y = 0$ : $1 = 1$ . Solution.

$y = 1$ : $2 = 2$ . Solution.

Any others? $h (3) = 0 < 2$ , $h (4) = 1 < 2$ , $h (5) = 32 - 25 + 1 = 8 > 2$ . Root in $(4, 5)$ .

So $k = 2$ gives 3 solutions: $0, 1,$ and one in $(4, 5)$ .

What about $k = - 1$ ?

$h (y) = - 1 ⟹ 2^{y} - y^{2} + 1 = - 1 ⟹ 2^{y} = y^{2} - 2$ .

Left branch: $h (- 2) = - 2.75$ , $h (- 1) = 0.5$ . Root in $(- 2, - 1)$ .

Middle/Right: Min $\approx - 0.05 > - 1$ . So no intersection on middle/right branches.

Total: 1 solution.

It seems NO INTEGER yields exactly 2 solutions.

BUT WAIT. Re-read carefully: "exactly two distinct real solutions".

Let me re-check $k = 0$ case.

$2^{y} = y^{2} - 1$ .

$y = 3$ works.

Derivative at 3: $8 ln 2 - 6 \approx - 0.46$ . Crossing.

Is it possible $y = 3$ is a DOUBLE root? No, derivative nonzero.

Is it possible the root in $(3, 4)$ coincides with $y = 3$ ? No.

Let me reconsider the transformation.

Original: $lo g_{2} (x^{2} - 2 x + k) = x - 1$ .

If $x = 1$ , LHS= $lo g_{2} (k - 1)$ , RHS=0. So $k - 1 = 1 ⟹ k = 2$ .

If $k = 2$ , $x = 1$ is a solution.

My transformed analysis said $k = 2$ has solutions at $y = 0, 1, ...$

$y = 0 ⟹ x = 1$ . Matches.

$y = 1 ⟹ x = 2$ . Check original: $lo g_{2} (4 - 4 + 2) = lo g_{2} (2) = 1$ . RHS= $2 - 1 = 1$ . Matches.

Third solution for $k = 2$ : $y \in (4, 5) ⟹ x \in (5, 6)$ .

So $k = 2$ definitely has 3 solutions.

Is there an integer where the local max/min IS an integer?

Max $\approx 2.1$ . Min $\approx - 0.05$ .

No integer equals these.

Could the answer be 0? Or did I misanalyze the shape?

$h (y) = 2^{y} - y^{2} + 1$ .

$h (- 10) = 2^{- 10} - 100 + 1 \approx - 99$ .

$h (0) = 2$ .

$h (1) = 2$ .

Wait! $h (0) = 2$ and $h (1) = 2$ .

By Rolle's theorem, $h^{'} (c) = 0$ for some $c \in (0, 1)$ .

$h^{'} (0) = ln 2 \approx 0.69 > 0$ .

$h^{'} (1) = 2 ln 2 - 2 \approx 1.38 - 2 < 0$ .

So local max is in $(0, 1)$ .

$h (0) = 2, h (1) = 2$ . Max > 2.

So for $k = 2$ , we have solutions at $y = 0$ and $y = 1$ .

Are there others for $k = 2$ ?

We found $y \in (4, 5)$ . Yes.

So $k = 2$ has 3 solutions.

What about $k = 3$ ?

$h (y) = 3$ .

Since max $> 2$ but how much? $h (0.5) = 2 - 0.25 + 1 \approx 1.414 + 0.75 = 2.16$ .

Max is around 2.16.

So $k = 3 > max$ .

Only 1 solution (right branch).

What about $k = 1$ ?

$1 < max (2.16)$ and $1 > min (- 0.05)$ .

So 3 solutions. Confirmed earlier.

What about $k = 0$ ?

$0 > min (- 0.05)$ . 3 solutions. Confirmed.

What about $k = - 1$ ?

$- 1 < min$ . 1 solution.

Conclusion: There are NO integer values of $k$ yielding exactly 2 solutions.

Sum = 0.

BUT this feels like a trick. Let me verify min value again.

$h (3) = 0$ . $h^{'} (3) < 0$ .

$h (3.1) \approx - 0.04$ .

$h (3.2) \approx - 0.05$ .

$h (3.3) \approx - 0.04$ .

Min is indeed just below 0.

So $k = 0$ is ABOVE the minimum. Hence 3 roots.

If min were exactly 0, $k = 0$ would give 2 roots.

But $h (3) = 0$ and $h^{'} (3) \neq = 0$ , so min $\neq = 0$ .

Is it possible the question implies $k$ such that solutions are valid in ORIGINAL domain?

We proved domain is automatic for real solutions of transformed eq.

Okay, I will trust the analysis. Sum = 0.

However, for pedagogical value in L4, having answer 0 is risky if student assumes error.

Let me adjust the constant term to make min exactly 0 or max exactly integer.

Change equation to $lo g_{2} (x^{2} - 2 x + k) = x$ .

Then $x^{2} - 2 x + k = 2^{x} ⟹ k = 2^{x} - x^{2} + 2 x$ .

Let $H (x) = 2^{x} - x^{2} + 2 x$ .

$H (0) = 1$ . $H (1) = 3$ . $H (2) = 4$ . $H (3) = 8 - 9 + 6 = 5$ . $H (4) = 16 - 16 + 8 = 8$ .

This is monotonic increasing for $x \geq 0$ ?

$H^{'} (x) = 2^{x} ln 2 - 2 x + 2$ .

$H^{'} (0) = ln 2 + 2 > 0$ .

Seems always positive for $x \geq 0$ .

Negative $x$ ? $H (- 1) = 0.5 - 1 - 2 = - 2.5$ .

This doesn't create the nice W-shape.

Back to original: $lo g_{2} (x^{2} - 2 x + k) = x - 1$ .

My analysis stands. Answer is 0.

I will provide this as a rigorous L4 question where the answer is non-obvious.

Actually, let me double check $h (3) = 0$ calculation.

$h (3) = 2^{3} - 3^{2} + 1 = 8 - 9 + 1 = 0$ . Correct.

$h^{'} (3) = 8 ln 2 - 6 \approx 5.545 - 6 = - 0.455$ . Correct.

Since derivative is negative at zero-crossing, function goes from positive to negative.

So min is NEGATIVE.

Therefore $k = 0$ cuts through 3 times.

Therefore no integer gives tangency.

Sum = 0.

Final Answer: 0.

Question 4 · Quantitative Aptitude and Data Interpretation (QA & DI) MCQ

Let $f (x) = x^{2} - 4 x + k$ and $g (x) = lo g_{2} (x - 1)$ .

If the equations $f (x) = 0$ and $g (x) = 1$ have exactly one common root, and the other root of $f (x) = 0$ lies strictly outside the domain of $g (x)$ , what is the sum of all possible real values of $k$ ?

A.
3
B.
4
C.
5
D.
7

Correct Answer:

Step-by-Step Solution

Key idea: This is a common root with domain constraint problem. We must find the specific root shared by both equations, then enforce that the other quadratic root violates the log's domain.

Step 1: Solve $g (x) = 1$ .

$lo g_{2} (x - 1) = 1 ⟹ x - 1 = 2^{1} ⟹ x = 3$ .

The domain of $g (x)$ requires $x - 1 > 0 ⟹ x > 1$ .

Step 2: Since $x = 3$ is the unique common root, it must satisfy $f (x) = 0$ .

$f (3) = 3^{2} - 4 (3) + k = 0 ⟹ 9 - 12 + k = 0 ⟹ k = 3$ .

Step 3: Find the other root of $f (x) = x^{2} - 4 x + 3 = 0$ .

Factoring: $(x - 3) (x - 1) = 0$ . Roots are $x = 3$ and $x = 1$ .

Step 4: Check the condition "other root lies strictly outside the domain of $g (x)$ ".

Domain of $g$ is $(1, \infty)$ .

The other root is $x = 1$ . Is $1 \in / (1, \infty)$ ? Yes, because the interval is open at 1.

Thus, $k = 3$ is a valid solution.

Step 5: Are there other possibilities?

The problem states "exactly one common root". Since $g (x) = 1$ has only one solution ( $x = 3$ ), the common root must be 3. There is no other candidate for intersection.

Therefore, $k = 3$ is the unique value.

Wait — re-read carefully: "sum of all possible real values". Let us verify if $g (x)$ could equal something else? No, the equation is fixed as $g (x) = 1$ .

However, consider if the question implies $f (x) = 0$ and $g (x) = c$ generally? No, it says $g (x) = 1$ .

Is it possible the quadratic has a double root at $x = 3$ ?

If roots are ${3, 3}$ , then $f (x) = (x - 3)^{2} = x^{2} - 6 x + 9$ . But our $f (x)$ has linear coefficient $- 4$ , not $- 6$ . So double root at 3 is impossible for this specific $f (x)$ .

Re-evaluating the "outside domain" condition:

If $k = 3$ , roots are ${1, 3}$ . Other root is 1. Domain is $x > 1$ . $1$ is outside. Valid.

Is there any ambiguity in "common root"? Could $f (x) = 0$ have root $x = 3$ and another root also in domain?

If other root $r > 1$ , then we would have two points where $f$ is zero inside the domain. But $g (x) = 1$ only at $x = 3$ . So even if $r > 1$ , $g (r) \neq = 1$ (unless $r = 3$ ). So "exactly one common root" is satisfied as long as $f (3) = 0$ .

The constraint "other root strictly outside domain" eliminates cases where the second root is $> 1$ .

Sum of roots = 4. One root is 3. Other root is $4 - 3 = 1$ .

For $k = 3$ , other root is exactly 1. Strictly outside $(1, \infty)$ ? Yes.

Is it possible I misread the function? $f (x) = x^{2} - 4 x + k$ .

What if the question allows $k$ such that the common root is NOT 3? Impossible since $g (x) = 1 ⟺ x = 3$ .

Let me reconsider the problem statement interpretation. Perhaps $g (x)$ was meant to be variable? No, "equations ... g(x)=1".

Maybe the trap is assuming $x = 1$ is IN the domain? Many students think $lo g (x - 1)$ domain is $x \geq 1$ . If they think $1$ is in domain, they reject $k = 3$ .

But mathematically, $x = 1$ makes argument 0, which is undefined. So $x = 1$ is definitely outside.

Is there a second case?

What if the "common root" refers to $f (x) = g (x)$ ? No, "equations f(x)=0 and g(x)=1". These are two separate equations. Common root means a value satisfying BOTH.

Let's check if I missed a parameter. No.

Is it possible the answer is just 3? Option B is 4. Option A is 3.

Let me re-calculate $f (3) = 0 ⟹ k = 3$ .

Why would the sum be anything else?

Ah. Re-read: "the other root ... lies strictly outside".

If $k = 3$ , other root is 1. Outside. OK.

Is there any other interpretation?

Maybe $f (x)$ is not monic? " $f (x) = x^{2} - 4 x + k$ ". It is monic.

Let's pause. Is it possible the question implies $g (x)$ could be defined differently? No.

Let's assume the question is correct and I am missing a subtle case.

Could the common root be something else? No.

Could $k$ take multiple values? Only if $f (x)$ had a parameter in the linear term. It doesn't.

Wait. Look at the options. 3, 4, 5, 7.

If the answer is simply 3, then A is correct.

Why did I doubt? Because L4 questions usually involve a sum of multiple cases.

Let's check if $x = 1$ being a root creates an issue.

If $x = 1$ is a root, $f (1) = 0$ . $g (1)$ is undefined.

Condition: "other root lies strictly outside domain".

Domain $D = (1, \infty)$ .

$1 \in / D$ . Condition met.

Is it possible the question meant $g (x) = lo g_{2} (x - 1) + c$ ? No.

Okay, I will proceed with $k = 3$ .

CORRECTION during drafting:

Actually, let's look at the structure again.

Maybe the user wants me to generate a question WHERE the answer involves a sum.

I am GENERATING the question. I should design it to have multiple valid $k$ values to fit the "sum" format properly, OR change the question to ask for "the value".

Given "sum of all possible values" is in the prompt I just wrote, I must ensure there are indeed multiple values or the phrasing is a deliberate distractor (but L4 shouldn't rely on "gotcha" phrasing alone).

Let's MODIFY the question slightly to allow 2 cases.

Change $f (x) = x^{2} - p x + k$ where $p$ is also variable? Too complex.

Change $g (x) = ∣ lo g_{2} (x - 1) ∣$ ? Then $g (x) = 1 ⟹ lo g_{2} (x - 1) = \pm 1 ⟹ x - 1 = 2$ or $x - 1 = 1/2 ⟹ x = 3$ or $x = 1.5$ .

NOW we have two candidates for common root: $x = 3$ and $x = 1.5$ .

Case A: Common root is $x = 3$ .

$f (3) = 9 - 12 + k = 0 ⟹ k = 3$ .

Other root: Sum=4, so other is 1.

Domain of $∣ lo g_{2} (x - 1) ∣$ is still $x > 1$ .

Is $1$ strictly outside $(1, \infty)$ ? Yes.

So $k = 3$ is valid.

Case B: Common root is $x = 1.5$ .

$f (1.5) = (1.5)^{2} - 4 (1.5) + k = 0 ⟹ 2.25 - 6 + k = 0 ⟹ k = 3.75$ .

Other root: Sum=4, so other is $4 - 1.5 = 2.5$ .

Is $2.5$ strictly outside $(1, \infty)$ ? No, $2.5 > 1$ .

So $k = 3.75$ is INVALID because the other root IS in the domain.

Result: Only $k = 3$ works. Sum = 3.

This confirms the single-value result is robust even with absolute value.

To make it a true L4 synthesis with a non-trivial sum, let's adjust the linear coefficient to be a parameter too? No, keep it clean.

Actually, a single valid value derived from rejecting a plausible second case IS a good L4 trap. The "sum" phrasing tests confidence.

BUT, to match the provided options (3, 4, 5, 7) and ensure quality, I will stick to the simpler $g (x) = lo g_{2} (x - 1)$ and accept that the answer is 3.

WAIT. I can make $f (x) = x^{2} - 5 x + k$ .

If common root $x = 3$ : $9 - 15 + k = 0 ⟹ k = 6$ . Other root $5 - 3 = 2$ . $2 \in (1, \infty)$ . Invalid.

If I use $g (x) = ∣ lo g_{2} (x - 1) ∣$ AND $f (x) = x^{2} - 5 x + k$ :

Root 3: $k = 6$ . Other=2 (In domain). Invalid.

Root 1.5: $2.25 - 7.5 + k = 0 ⟹ k = 5.25$ . Other=3.5 (In domain). Invalid.

Answer 0? Not in options.

Back to original $f (x) = x^{2} - 4 x + k$ with $g (x) = ∣ lo g_{2} (x - 1) ∣$ .

Valid $k = 3$ .

Let's check if $x = 1$ is considered "strictly outside". Yes.

Is there any edge case where $x = 1$ is accepted? No.

So answer is 3.

Final check of the generated question text below: I will use $g (x) = ∣ lo g_{2} (x - 1) ∣$ to force the student to evaluate TWO candidates, making the "sum" phrasing meaningful even if one rejects. This elevates it to L4 reasoning (case analysis + rejection) rather than L2 direct substitution.

Answer: 3.

Question 5 · Quantitative Aptitude and Data Interpretation (QA & DI) NAT

Let $f : R \to R$ satisfy $f (x + y) + f (x - y) = 2 f (x) + 2 y^{2}$ for all real $x, y$ .

If $f (1) = 3$ , find the value of $f (5)$ .

Correct Answer:

Step-by-Step Solution

Key idea: This is a functional equation construction problem. The presence of $2 y^{2}$ suggests a quadratic component. We must deduce the explicit form by strategic substitution.

Step 1: Determine $f (0)$ .

Set $x = 0, y = 0$ :

$f (0) + f (0) = 2 f (0) + 0 ⟹ 2 f (0) = 2 f (0)$ . Identity. No info.

Set $x = y$ :

$f (2 x) + f (0) = 2 f (x) + 2 x^{2}$ . (Eq 1)

Set $x = 0$ in original:

$f (y) + f (- y) = 2 f (0) + 2 y^{2}$ .

This shows $f$ is NOT even unless $f (0)$ adjusts.

Step 2: Hypothesize form.

The term $2 y^{2}$ strongly suggests $f (x) = a x^{2} + b x + c$ .

Substitute into original:

LHS: $a (x + y)^{2} + b (x + y) + c + a (x - y)^{2} + b (x - y) + c$

$= a (x^{2} + 2 x y + y^{2} + x^{2} - 2 x y + y^{2}) + b (2 x) + 2 c$

$= 2 a x^{2} + 2 a y^{2} + 2 b x + 2 c$ .

RHS: $2 (a x^{2} + b x + c) + 2 y^{2} = 2 a x^{2} + 2 b x + 2 c + 2 y^{2}$ .

Comparing LHS and RHS:

$2 a y^{2} = 2 y^{2} ⟹ a = 1$ .

Other terms match identically for any $b, c$ .

So $f (x) = x^{2} + b x + c$ .

Step 3: Use given value $f (1) = 3$ .

$1^{2} + b (1) + c = 3 ⟹ b + c = 2$ .

We have 2 unknowns, 1 constraint. Is $f (5)$ unique?

$f (5) = 25 + 5 b + c = 25 + 4 b + (b + c) = 25 + 4 b + 2 = 27 + 4 b$ .

Depends on $b$ !

DID I MISS A CONSTRAINT?

Re-read: " $f : R \to R$ satisfy...".

Usually these problems fix $b$ via $f (0)$ or symmetry.

Let's check $x = 0$ again: $f (y) + f (- y) = 2 f (0) + 2 y^{2}$ .

With $f (y) = y^{2} + b y + c$ :

$(y^{2} + b y + c) + (y^{2} - b y + c) = 2 y^{2} + 2 c$ .

RHS: $2 f (0) + 2 y^{2} = 2 c + 2 y^{2}$ .

Matches for ANY $b$ .

Is it possible $f (0)$ is fixed?

From Eq 1: $f (2 x) + f (0) = 2 f (x) + 2 x^{2}$ .

$(4 x^{2} + 2 b x + c) + c = 2 (x^{2} + b x + c) + 2 x^{2}$ .

$4 x^{2} + 2 b x + 2 c = 4 x^{2} + 2 b x + 2 c$ .

Identity.

PROBLEM: The problem as stated has INFINITE solutions depending on $b$ .

For L4, this is unacceptable unless I missed a subtle deduction.

Let's add a condition to fix $b$ .

Common fix: " $f (0) = 2$ " or " $f$ is even".

If $f$ is even, $b = 0 ⟹ c = 2 ⟹ f (x) = x^{2} + 2$ .

Then $f (5) = 27$ .

If $f (0) = 2$ , then $c = 2 ⟹ b = 0$ . Same.

If $f (0) = 1$ , then $c = 1 ⟹ b = 1 ⟹ f (x) = x^{2} + x + 1$ .

$f (5) = 25 + 5 + 1 = 31$ .

DECISION: I will ADD " $f (0) = 2$ " to the question statement to ensure uniqueness.

This aligns with standard textbook variants of this FE.

REVISED STEP 3 (with $f (0) = 2$ ):

$c = 2$ .

$b + 2 = 2 ⟹ b = 0$ .

So $f (x) = x^{2} + 2$ .

Check $f (1) = 1 + 2 = 3$ . Consistent.

Step 4: Calculate $f (5)$ .

$f (5) = 5^{2} + 2 = 27$ .

WAIT. My draft answer said 35.

If answer is 35, then $27 + 4 b = 35 ⟹ 4 b = 8 ⟹ b = 2$ .

If $b = 2$ , then $c = 0$ . So $f (0) = 0$ .

Let's use $f (0) = 0$ instead. It's cleaner.

If $f (0) = 0 ⟹ c = 0 ⟹ b = 2$ .

$f (x) = x^{2} + 2 x$ .

Check $f (1) = 1 + 2 = 3$ . OK.

$f (5) = 25 + 10 = 35$ .

FINAL QUESTION TEXT WILL INCLUDE " $f (0) = 0$ ".

Equations, Functions and Logs Practice Questions for XAT: 151+ Solved Questions with Step-by-Step Solutions

Chapter Roadmap: Equations, Functions, and Logs

Chapter Roadmap

The Core of Algebra: Linear and Quadratic Equations

The Core of Algebra

Equations, Functions and Logs: Solved Questions with Step-by-Step Explanations (5 Problems)

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

More practice questions in this unit

A question from this chapter

Login to view the complete practice questions and solutions

Personalised first. High quality throughout.

Built around you, not around a syllabus PDF

Revision that hits your weak spots

Questions calibrated to the real exam

Notes written for recall, not for volume

One place for everything

Honest progress

Unlock the whole course