Question
Solve the following differential equation
$\sec ^2 x \tan y d x+\sec ^2 y \tan x d y=0$
Solution: $\sec ^2 x \tan y d x+\sec ^2 y \tan x d y=0$
$\therefore \frac{\sec ^2 x}{\tan x} d x+\square=0$
Integrating, we get
$\square+\int \frac{\sec ^2 y}{\tan y} d y=\log c$
Each of these integral is of the type
$\int \frac{ f ^{\prime}(x)}{ f (x)} d x=\log | f ( x )|+\log C$
$\therefore$ the general solution is
$\square+\log |\tan y|=\log c$
$\therefore \log |\tan x \cdot \tan y|=\log c$
$\square$
This is the general solution.

Answer

$\sec ^2 x \tan y d x+\sec ^2 y \tan x d y=0$
$\therefore \frac{\sec ^2 x}{\tan x} d x+\frac{\sec ^2 y}{\tan y} d y=0$
Integrating, we get
$\int \frac{\sec ^2 x}{\tan x} d x+\int \frac{\sec ^2 y}{\tan y} d y=\log c$
Each of these integral is of the type
$\int \frac{ f ^{\prime}(x)}{ f (x)} d x=\log | f ( x )|+\log c$
$\therefore$ the general solution is
$ \log |\tan x |+\log |\tan y|=\log c$
$\therefore \log |\tan x \cdot \tan y|=\log c$
$\therefore \tan x \cdot \tan y=c $
This is the general solution.

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

Similar questions

Classify each of the following matrices as a row, a column, a square, a diagonal, a scalar, a unit, an upper triangular, a lower triangular
1. $\left[\begin{array}{ccc}3 & -2 & 4 \\ 0 & 0 & -5 \\ 0 & 0 & 0\end{array}\right]$
2. $\left[\begin{array}{c}5 \\ 4 \\ -3\end{array}\right]$
3. $\left[\begin{array}{lll}9 & \sqrt{2} & -3\end{array}\right]$
4. $\left[\begin{array}{ll}6 & 0 \\ 0 & 6\end{array}\right]$
Determine k if
$
f(x)=\left\{\begin{array}{ll}
k e^{-\theta x} & \text { for } 0 \leq x<\infty, \theta>0 \\
0 & \text { otherwise }
\end{array}\right.
$
is the p.d.f. of the r.v. $X$. Also find $P\left(X>\frac{1}{\theta}\right)$. Find $M$ if $P(0 < X < M)$=$\frac{1}{2}$
Use the method of least squares to fit a trend line to the data in problem 1 above. Also, obtain the trend value for the year 1975.
Solve the following problem of sequencing for minimizing the total elapsed time and idle time for both the machines.
Job P Q R S T U
$M_1$ 1 4 6 3 5 2
$M_2$ 3 6 8 8 1 5
The optimal sequence of the jobs as follows:
           
Total elasped time is obtained as follows:
Job
sequence
Machine A Machine B Idle time for
Machine B
Time
In
Time
Out
Time
In
Time
Out
P $\square$ 1 1 $\square$ $\square$
U $\square$ 3 4 $\square$ $\square$
S $\square$ 6 9 $\square$ $\square$
Q $\square$ 10 17 $\square$ $\square$
R $\square$ 16 23 $\square$ $\square$
T $\square$ 21 31 $\square$ $\square$
Total elapsed time $T=\square$ minutes
Idle time for Machine $A=T-\square=\square$ minutes
Idle time for Machine $B=\square$
It is known that, in a certain area of a large city, the average number of rats per bungalow is five. Assuming that the number of rats follows Poisson distribution,
find the probability that a randomly selected bungalow has exactly $5$ rats inclusive. Given $e^{-5}= 0.0067$.
Find $\frac{ d y}{ d x}$, if $y = x ^{ x }+(7 x -1)^{ x }$
The probability that a bomb will hit the target is $0.8.$ Using the following activity, find the probability that, out of $5$ bombs, exactly $2$ will miss the target
Solution: Let $p =$ probability that bomb miss the target
$ \therefore q =\square, p =\square, n =5 .$
$X \sim B (5, \square), P ( x )={ }^{ n } C _x P ^x q ^{ n -x}$
$P ( X =2)={ }^5 C _2 \square=\square $
For annuity due,
$C=\text{₹} 20,000, n=3, I=0.1,(1.1)^{-3}=0.7513$
Therefore, $P=\frac{\square}{0.1} \times\left[1-(1+0.1)^{\square}\right]$
$ =2,00,000[1-0.7513]$
$=\text{₹} \square $
If $\left[\begin{array}{cc}2 a+b & 3 a-b \\ c+2 d & 2 c-d\end{array}\right]=\left[\begin{array}{cc}2 & 3 \\ 4 & -1\end{array}\right]$, find $a , b , c$ and $d$.
Write the dual statement of each of the following compound statements:
(i) 13 is prime number and India is a democratic country.
(ii) Karina is very good or everybody likes her.
(iii) Radha and Sushmita can not read Urdu.
(iv) A number is real number and the square of the number is non-negative.