0% found this document useful (0 votes)
54 views11 pages

Maths Pta-1 Assignment

The document is an assignment for a Mathematics PTA-1 exam, divided into two sections with a total of 12 questions. Each question has multiple-choice answers, with specific marking schemes for correct, incorrect, and unanswered questions. The questions cover various mathematical concepts and require problem-solving skills to determine the correct options.

Uploaded by

abhiimadabathuni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
54 views11 pages

Maths Pta-1 Assignment

The document is an assignment for a Mathematics PTA-1 exam, divided into two sections with a total of 12 questions. Each question has multiple-choice answers, with specific marking schemes for correct, incorrect, and unanswered questions. The questions cover various mathematical concepts and require problem-solving skills to determine the correct options.

Uploaded by

abhiimadabathuni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

MATHEMATICS PTA-1 (ASSIGNMENT)

SECTION 1 (Maximum Marks: 12)


 This section contains FOUR questions.
 Each question has FOUR options (A), (B), (C) and (D). ONLY ONE of these four options is correct.
 For each question, darken the bubble(s) corresponding to all the correct option in the ORS.
 For each question, marks will be awarded in one of the following categories:
Full Marks : +3 If only the bubble corresponding to the correct option is darkened.
Zero Marks : 0 If none of the bubbles is darkened.
Negative Marks : –1 In all other cases.

1. Consider a function f defined on the set of all non-negative integers such that f(0) = 0 and f(n) + f(n – 1)
= nf(n – 1) + (n – 1) f(n – 2) for n  2 then f(5) is equal to
(A) 40 (B) 44 (C) 45 (D) 60

2. Let [x3 + x2 + x + 1] = [x3 + x2 + 1] + x (where [.] denotes greatest integer function) then the number of
solutions of the equation log|[x]| = 2 - |[x]| is
(A) 1 (B) 0 (C) 3 (D) 2
3. Let N be the number of functions f : A  A where A = {1, 2, 3, 4, 5} such that f({1, 2, 3}) and
f(f({1, 2, 3})) are disjoint. Let M be the sum of all the prime factors of N, then the value of M is equal
to
(A) 5 (B) 6 (C) 7 (D) 8

4. Let [a, b]  {t  R, a  t  b} , where a  b


Now, define d(x,[a, b])  min{| x  y |:a  y  b}, x  R
d(x,[0,1])
A function f : R  [0,1] is defined by f (x) 
d(x,[0,1])  d(x,[2,3])
Then which of the following statement is are false:
(A) f (x) is one – one (B) f (x) is onto function
(C) f (x) is bijection (D) f (x) is an odd function
SECTION 2 (Maximum Marks: 12)
 This section contains THREE questions.
 Each question has FOUR options (A), (B), (C) and (D). ONE OR MORE THAN ONE of these four option(s)
is(are) correct.
 For each question, darken the bubble(s) corresponding to all the correct option(s) in the ORS.
 For each question, marks will be awarded in one of the following categories:
Full Marks : +4 If only the bubble(s) corresponding to all the correct option(s) is(are)
darkened.
Partial Marks : +1 Four darkening a bubble corresponding to each correct option, provided
NO incorrect option is darkened.
Zero Marks : 0 If none of the bubbles is darkened.
Negative Marks : –2 In all other cases.
 For example, if (A), (C) and (D) are all the correct options for a question, darkening all these three will
result in +4 marks; darkening only (A) and (D) will result in +2 marks; and darkening (A) and (B) will
result in -2 marks, as a wrong option is also darkened.

5. Let M be the number of functions f : {1, 2, 3, ….., 2024}  {1, 2, 3, ……., 2024} satisfying
f(j) < f(i) + j – i  integers i, j such that 1  i < j  2024 then identify the correct option(s)
 2023 2023 2
(A) M   2   2023 Ci  , 3   2023 Ci  
2

 i 0 i0 
 2023 2023 2
(B) M     2023 Ci  , 2   2023 Ci  
2

 i 0 i 0 
(C) M  2024C2024  2025C2024  .....  4046C2024
(D) M  2023C2023  2024C2023  2024 C2023  ....  2026C2023
  x 
6. Consider two functions f(x) and g(x) satisfying f  x    g  x   3 where f  x    x     and
  2 
x
g  x   x    (where  denotes greatest integer function and  denotes fractional part function)
3
and range of values of x satisfying the given equation is [a, b) then identify the correct statement(s)
(A) a + b = 7 (B) b – a = 2 (C) a + 2b = 10 (D) ab = 12

 1 , x  (, 0)

7. Let f1 (x)   x  1 , x  [0,3] and f 2 (x)  f1 (1  x) , f3 (x)  f 2 (| x |) , f 4 (x)  f 3 (2x)  5 , then identify
 2 , x  (3, )

the incorrect statement(s)
(A) f3 (x) and f 4 (x) are even functions
(B) f3 (x) is many – one and onto function
(C) Range of  f1 (x)   Range of  f 2 (x)  where [.] = greatest integer function
(D) f1 (x)  f 2 (x)  f3 (x)  f 4 (x) is an odd function
8. Let L denotes the number of surjective functions f : A  B where set A contains 4 elements and set B
contains 3 elements. M denotes number of elements in the range of the function, f(x) = sec-1(Sgn x) +
cosec-1 (Sgn x) where Sgn x denotes signum function of x and N denotes coefficient of t5 in (t + t2)5
LM  N
(1 + t3)8, then the value of is equal to
19

9. Let f : R  R be an injective mapping and p, q, r are non-zero distinct real quantities satisfying
p  pq q r q
f f  and f    f   . If the graph of g(x) = px2 + qx + r passes through M(1, 6) then
r  qr  r p 8
is equal to

–7–
 1 2 1
10. Let Pn(x) be a function satisfying h n
 Pn  x   1  2hx  h 2  , x  1, h  then the value of
n 0 3
P3(10) – 2480 is equal to

11. Let P(x) be a third degree polynomial with real coefficients such that |P(1)| = |P(2)| = |P(3)| = |P(5)| =
P 0
|P(6)| = |P(7)| = 12 then the value of is equal to
9

  2x  
12. Let f(x) = x2 – 2ax + a – 2 and g  x    2  sin 1   . If the set of real values of a for which
  1  x 2  
f(g(x)) < 0  x  R is (K1, K2) then value of 5(K1 + K2 – 2) is equal to (where  denotes greatest integer
function)
10  | x | N
13. Let N denotes number of integers in the domains of f (x)  then is equal to (where 
| x |  4 2

denotes greatest integer function)


14. Match the following Column
List-I List-II
4 3 2
(1) 7{x} + 9{x} {-x} – 5 {x} + 9{x} {-x} – 2 = 0 where {x} denotes (P) 0
fractional part of x, then 2x may be equal to
(2) If 2y2 + 2xy – 5x = 0 has non-negative integral solutions in x and y then (Q) 2
y may be equal to
(3) Let A = {1, 3, 5, 7} and B = {2, 4, 6, 8} then number of one-one function (R) 3
f : A  B such that f(i) – i  2  i  A
 x  sin x, x   0,   (S) 4

(4) Let f  x    0, x then the value of x for

  1  1
, x   ,  
 1   x  
2

which f(x) = f–1(x) is equal to


(T) 5
(A) (1)  (R), (2)  (R), (3)  (P), (4)  (P) (B) (1)  T, (2)  Q, (3)  P, (4)  P
(C) (1)  (Q), (2)  (Q), (3)  (Q), (4)  (P) (D) (1)  T, (2)  P, (3)  P, (4)  Q
15. Match the following Column
List-I List-II
 x   2x  (P) 3
(1) Number of solution of the equation       x , is (where 
2  5 
denotes greatest integer function)
(2) Number of solutions of the equation log 1 sin x  2  log 1 cos x in (Q) 4
2 2

 3 9 
 5 , 7  , is

(3) Number of solutions of the equations [x]{x}  x  2{x}  7 , is (where (R) 6


 denotes greatest integer function and {.} denotes fractional part
function)
(4) The number of integral values of x in the domain of function f defined (S) 8

as f  x   n n x  7 x  x  10 is
2

(T) 10
(A) (1)  (S); (2)  (S); (3)  (Q); (4)  (R)
(B) (1)  (T); (2)  (R); (3)  (R); (4)  (Q)
(C) (1)  (T); (2)  (S); (3)  (P); (4)  (R)
(D) (1)  (T); (2)  (S); (3)  (Q); (4)  (R)
16. Match the following
List-I List-II
(1) Let f : R  R defined as f  x   esgn x  e x , where sgn x denotes (P) Odd
  2

signum function of x, then f(x) is


1 (Q) Even
(2) Let f : (-1, 1)  R defined as f  x   x  x 4   where [x]
1 x 2

denotes greatest integer less than or equal to x, then f(x) is


(3) Let f : R  R defined as (R) Neither odd nor even
x  x  1  x 4  1  2x 4  x 2  2
f x  , then f(x) is
x2  x 1
(4) Let f : R  R defined as f(x) = x + 3x3 + 5x5 + …… + 101 x101 then (S) One-One
f(x) is
(T) Many-one
(A) (1)  R, S; (2)  R, T; (3)  R, S; (4)  P, S
(B) (1)  R, T; (2)  Q, T; (3)  R, T; (4)  P, S
(C) (1)  Q, S; (2)  R, S; (3)  R, T; (4)  P, S
(D) (1)  P, T; (2)  Q, T; (3)  P, T; (4)  Q, T
17. Match the following List – I with List – II
List-I List-II

  
(1) f : R  R ; f (x)   e x  , (where [.] denotes the greatest integer (P) One – One

function, and {.} denotes fractional part function)
(where sgn x denotes (Q) Many one
2
(2) Let f : R  R defined as f (x)  esgn(x)  e x
signum function of x, then f (x) )
 1  1 (R) Into and periodic
(3) f : R  R ; f (x)   x     x    2[ x] (where [.] denotes the
 2  2
greatest integer function)
(4) f :[1, )  (0, ) defined as f (x)  e x
2
x
, then f (x) is (S) Onto

(T) Periodic
(U) Constant
(A) (1)  (S); (2)  (U); (3)  (Q); (4)  (P)
(B) (1)  (Q); (2)  (Q); (3)  (T); (4)  (Q)
(C) (1)  (S); (2)  (U); (3)  (T); (4)  (Q)
(D) (1)  (Q); (2)  (Q); (3)  (R); (4)  (P)

You might also like