RankRizz
JEE MAIN 2020 · 02 SEP S2+4 / −1MEDIUMTRANSCRIBED

JEE Main 2020 Mathematics question — Sequences from recurrences and functional relations

Let f:R→Rf : R \to R be a function which satisfies f(x+y)=f(x)+f(y)f(x + y) = f(x) + f(y), ∀x,y∈R\forall x, y \in R. If f(1)=2f(1) = 2 and g(n)=∑k=1(n−1)f(k)g(n) = \sum_{k=1}^{(n-1)} f(k), n∈Nn \in N then the value of nn, for which g(n)=20g(n) = 20, is:

SOLUTION

We have a real-valued function that obeys the functional equation f(x+y)=f(x)+f(y)∀ x,y∈R.f(x+y)=f(x)+f(y) \quad \forall\,x,y\in\mathbb R.

First we find the values of ff at positive integers. Put y=1y=1 and x=k−1x=k-1 (where k∈Nk\in\mathbb N) in the given relation:

f(k)=f((k−1)+1)=f(k−1)+f(1).f(k)=f\big((k-1)+1\big)=f(k-1)+f(1).

Because f(1)=2,f(1)=2, this becomes

f(k)=f(k−1)+2.f(k)=f(k-1)+2.

Apply the same step repeatedly (mathematical induction):

For k=2k=2: f(2)=f(1)+2=2+2=4.f(2)=f(1)+2=2+2=4.

For k=3k=3: f(3)=f(2)+2=4+2=6.f(3)=f(2)+2=4+2=6.

We notice the pattern f(k)=2k.f(k)=2k. We justify it formally by induction: assume f(m)=2mf(m)=2m for some integer m≥1,m\ge 1, then

f(m+1)=f(m)+2=2m+2=2(m+1),f(m+1)=f(m)+2=2m+2=2(m+1),

which completes the proof. Hence for every natural number kk

f(k)=2k.f(k)=2k.

Now we examine the auxiliary function g(n)g(n) defined by the sum

g(n)=∑k=1 n−1f(k),n∈N.g(n)=\sum_{k=1}^{\,n-1} f(k), \quad n\in\mathbb N.

Substituting f(k)=2kf(k)=2k gives

g(n)=∑k=1 n−12k=2∑k=1 n−1k.g(n)=\sum_{k=1}^{\,n-1} 2k = 2\sum_{k=1}^{\,n-1} k.

We state the standard formula for the sum of the first mm natural numbers: ∑k=1mk=m(m+1)2.\sum_{k=1}^{m} k = \dfrac{m(m+1)}{2}. Here m=n−1,m=n-1, so

∑k=1 n−1k=(n−1)n2.\sum_{k=1}^{\,n-1} k = \dfrac{(n-1)n}{2}.

Substituting this into the expression for g(n):g(n):

g(n)=2((n−1)n2)=n(n−1).g(n)=2\left(\dfrac{(n-1)n}{2}\right)=n(n-1).

The problem states that g(n)=20.g(n)=20. Therefore we must solve

n(n−1)=20.n(n-1)=20.

Expanding gives the quadratic equation

n2−n−20=0.n^{2}-n-20=0.

Factorising, we write

(n−5)(n+4)=0.(n-5)(n+4)=0.

This yields two roots: n=5n=5 and n=−4.n=-4. Because nn is a natural number, we discard the negative value and keep

n=5.n=5.

Hence, the correct answer is Option A.

Tagged Sequences from recurrences and functional relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicSequences from recurrences and functional relations
TypeMultiple choice