Answer:
try Math
way
Step-by-step explanation:
Remark
The proof is only true if m and n are equal. Make it more general.
m = 2k
n = 2v
m + n = 2k + 2v = 2(k + v).
k and v can be equal but many times they are not. From that simple equation you cannot do anything for sure but divide by 2.
There are 4 combinations
m is divisible by 4 and n is not. The result will not be divisible by 4.
m is not divisible by 4 but n is. The result will not be divisible by 4.
But are divisible by 4 then the sum will be as well. Here's the really odd result
If both are even and not divisible by 4 then their sum is divisible by 4
Answer:
sin θ . tan θ
Step-by-step explanation:
Note : -
sec ( - θ ) = sec θ
Formula / Identity : -
sec θ = 1 / cos θ
sec ( - θ ) - cos θ
= [ 1 / cos θ ] - cos θ
{ LCM = cos θ }
= [ 1 / cos θ ] - [ cos²θ / cos θ ]
= [ 1 - cos²θ ] / cos θ
{ 1 - cos²θ = sin²θ }
= sin²θ / cos θ
{ sin²θ = sin θ . sin θ }
= sin θ . sin θ / cos θ
{ sin θ / cos θ = tan θ }
= sin θ . tan θ
Hence, simplified.
Answer:
Is that a magic spell??
Step-by-step explanation:
???
