Let a=4 i-j+k, b=11 i-j+k and c be a vector such that (a+b) c=c (… - Vidyadip

MCQ

Let $\vec{a}=4 \hat{i}-\hat{j}+\hat{k}, \vec{b}=11 \hat{i}-\hat{j}+\hat{k}$ and $\vec{c}$ be a vector such that $(\vec{a}+\vec{b}) \times \vec{c}=\vec{c} \times(-2 \vec{a}+3 \vec{b}) \text {. }$

If $(2 \vec{a}+3 \vec{b}) \cdot \vec{c}=1670$, then $|\vec{c}|^2$ is equal to :

A
$1627$
✓
$1618$
C
$1600$
D
$1609$

✓

Answer

Correct option: B.

$1618$

b
$ (\vec{a}+\vec{b}) \times \vec{c}-\vec{c} \times(-2 \vec{a}+3 \vec{b})=0 $

$ (\vec{a}+\vec{b}) \times \vec{c}+(-2 \vec{a}+3 \vec{b}) \times \vec{c}=0 $

$ \Rightarrow(\vec{a}+\vec{b})-2 \vec{a}+3 \vec{b}) \times \vec{c}=0 $

$ \Rightarrow \vec{c}=\lambda(4 \vec{b}-\vec{a}) $

$ \Rightarrow=\lambda(44 \hat{i}-4 \hat{j}+4 \hat{k}-4 \hat{i}+\hat{j}-\hat{k}) $

$ =\lambda(40 \hat{i}-3 \hat{j}+3 \hat{k})$

Now

$ (8 \hat{i}-2 \hat{j}+2 \hat{k}+33 \hat{i}-3 \hat{j}+3 \hat{k}) \cdot \lambda(40 \hat{i}-3 \hat{j}+3 \hat{k})=1670 $

$ \Rightarrow(41 \hat{i}-5 \hat{j}+5 \hat{k}) \cdot(40 \hat{i}-3 \hat{j}+3 \hat{k}) \times \lambda=1670) $

$ \Rightarrow(1640+15+15) \lambda=1670 \Rightarrow \lambda=1 $

$ \text { so } \overrightarrow{\mathrm{c}}=40 \hat{i}-3 \hat{j}-3 \hat{k} $

$ \Rightarrow|\overrightarrow{\mathrm{c}}|^2=1600+9+9=1618$

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 10. vector algebra→10. vector algebra — all question types→Maths STD 12 Science question papers→Gujarat Board STD 12 Science question papers→Gujarat Board question paper generator→

Similar questions

Let $f: R \rightarrow R$ be defined as $f(x)=\left\{\begin{array}{ccc}\frac{a-b \cos 2 x}{x^2} & ; & x<0 \\ x^2+c x+2 & ; & 0 \leq x \leq 1 \\ 2 x+1 & ; & x>1\end{array}\right.$ If $f$ is continuous everywhere in $R$ and $\mathrm{m}$ is the number of points where $f$ is $NOT$ differential then $\mathrm{m}+\mathrm{a}+\mathrm{b}+\mathrm{c}$ equals:

Solving an integer programming problem by rounding off answers obtained by solving it as a linear programming problem (using simplex), we find that.

The values of decision variables obtained by rounding off are always very close to the optimal values.
The value of the objective function for a maximization problem will likely be less than that for the simplex solution.
The value of the objective function for a minimization problem will likely be less than that for the simplex solution.
All constraints are satisfied exactly.
None of the above.

$\mathop \smallint \limits_{ - \pi /2}^{\pi /2} \frac{{{{\sin }^2}x}}{{1 + {2^x}}}dx =$ . .. .

A relation R is defined from {2, 3, 4, 5} to {3, 6, 7, 10} by : xRy ⇔ x is relatively prime to y. Then, domain of R is:

{2, 3, 5}
{3, 5}
{2, 3, 4}
{2, 3, 4, 5}

Let $x$ be the length of one of the equal sides of an isosceles triangle, and let $\theta$ be the angle between them. If $x$ is increasing at the rate $(1/12) \,\,m/hr$, and $\theta$ is increasing at the rate of $\pi /180 \,\,radians/hr$ then the rate in $m^2\,/hr$ at which the area of the triangle is increasing when $x = 12\, m$ and $\theta = \pi /4$

Let $\mathrm{f}(\mathrm{x})$ be a polynomial of degree $3$ such that $\mathrm{f}(\mathrm{k})=-\frac{2}{\mathrm{k}}$ for $\mathrm{k}=2,3,4,5 .$ Then the value of $52-10 \mathrm{f}(10)$ is equal to :

Among the relations $S =\left\{( a , b ): a , b \in R -\{0\}, 2+\frac{ a }{ b } > 0\right\}$ And $T =\left\{( a , b ): a , b \in R , a ^2- b ^2 \in Z \right\}$,

If $A = \left[ \begin{array}{l}1\\2\\3\end{array} \right],$then $AA' = $

Let $A = \int\limits_0^1 \, \frac{{{e^t}\,\,\,d\,t}}{{1\,\, + \,\,t}}$ then $\int\limits_{a - 1}^a {\,\,\frac{{{e^{ - t}}\,dt}}{{t\, - \,a\, - \,1}}} $ has the value

The sum of the terms of an infinitely decreasing geometric progression is equal to the greatest value of the function $f (x) = x^3 + 3x -9$ on the interval $[- 2, 3]$ . If the difference between the first and the second term of the progression is equal to $f ' (0)$ then the common ratio of the $G.P$. is