^ - 1 [ ( - 30^o )] = ....... ^o - Vidyadip

MCQ

${\sec ^{ - 1}}[\sec ( - {30^o})] = $ ....... $^o$

A
$-60$
B
$-30$
✓
$30$
D
$150$

✓

Answer

Correct option: C.

$30$

c
(c) ${\sec ^{ - 1}}[\sec \,( - {30^o})] = {\sec ^{ - 1}}(\sec {30^o}) = {30^o}$.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Explore more

More "M.C.Q (1 Marks)" from STD 12 - 2. inverse trigonometric function→STD 12 - 2. inverse trigonometric function — all question types→Mathematics STD 12 Science question papers→CBSE Board STD 12 Science question papers→CBSE Board question paper generator→

Similar questions

If $X$ follows a binomial distribution with parameter $\text{n}=8$ and $\text{p}=\frac{1}{2},$ then $\text{P(|X}-4|\leq2)$ equals :

If $4a + 2b + c = 0,$ then the equation $3ax^2+ 2bx + c = 0$ has atleast one real root lying in the interval:

The principal solution of $\tan ^{-1}\left(\tan \left(\frac{7 \pi}{6}\right)\right)$ is

${\tan ^{ - 1}}\left( {\frac{{\sqrt {1 + {x^2}} - 1}}{x}} \right) = $

Four persons P, Q, R and S are initially at the four corners of a square side d. Each person now moves with a constant speed v in such a way that P always moves directly towards Q, Q towards R, R towards S, and S towards P. The four persons will meet after time.

A four $-$ digit number is formed by using the digits $1, 2, 4, 8$ and $9$ without repitition. If one number is selected from those numbers, then what is the probability that it will be an odd number?

The principal value of $\tan ^{-1}\left(\tan \frac{3 \pi}{5}\right)$ is

The differential coefficient of ${a^x} + \log x.\sin x$ is

The points $A(1, 1, 0), B(0, 1, 1), C(1, 0, 1)$ and $\text{D}\big(\frac{2}{3},\frac{2}{3},\frac{2}{3}\big)$

Minimise $\text{Z}=\sum\limits^{\text{n}}_{\text{j}=1}\sum\limits^{\text{m}}_{\text{i}=1}\text{c}_{\text{ij}}\cdot\text{x}_{\text{ij}}$ Subject to $\sum\limits^{\text{m}}_{\text{i}=1}\text{x}_{\text{ji}}=\text{b}_{\text{j}},\text{j}=1,2,....\text{n}$ $\sum\limits^{\text{n}}_{\text{j}=1}\text{x}_{\text{ji}}=\text{b}_{\text{j}},\text{j}=1,2,.....,\text{m}$ is a $\text{LPP}$ with number of constraints.