Answer:
The answer to your question is x = 3; y = 3
Step-by-step explanation:
Data
angle = 45°
Opposite side = x
Adjacent side = y
hypotenuse = 3√2
To solve this problem, use trigonometric functions.
1) To find x, use the trigonometric function sine.
sin Ф = Opposite side / hypotenuse
-Solve for Opposite side (x)
Opposite side = hypotenuse x sin Ф
-Substitution
Opposite side = 3√2 sin 45
-Simplification
Opposite side = 3√2 (1 / √2)
Opposite side = 3(1)
-Result
x = 3
2) To find y use the trigonometric function cosine
cos Ф = Adjacent side / hypotenuse
-Solve for Adjacent side
Adjacent side = hypotenuse x cos Ф
-Substitution
Adjacent side = 3√2 x cos 45
-Simplification
Adjacent side = 3√2 x (1/√2)
Adjacent side = 3(1)
-Result
y = 3
Answer:
25
Step-by-step explanation:
13+1.50m
13+1.50(8)
13+12
25
Answer:
In order to solve this problem, you have to find the lowest common denominator. Take multiples of both 6 and 4 and see which is the lowest you have in common.
4: 4, 8, 12, 16, 20
6: 6, 12, 18, 24
So 12 is the lowest common multiple....
5/6 x ?/? = ?/12 (you have to multiply the numerator and the denominator by the same number)
3/4 x ?/? = ?/12 (you have to multiply the numerator and the denominator by the same number)
When the denominators are the same, you can subtract the numerators. The denominator will stay 12!
Step-by-step explanation:
YAY! I want a brain
Answer:
The given relation R is equivalence relation.
Step-by-step explanation:
Given that:
![((a, b), (c, d))\in R](https://tex.z-dn.net/?f=%28%28a%2C%20b%29%2C%20%28c%2C%20d%29%29%5Cin%20R)
Where
is the relation on the set of ordered pairs of positive integers.
To prove, a relation R to be equivalence relation we need to prove that the relation is reflexive, symmetric and transitive.
1. First of all, let us check reflexive property:
Reflexive property means:
![\forall a \in A \Rightarrow (a,a) \in R](https://tex.z-dn.net/?f=%5Cforall%20a%20%5Cin%20A%20%5CRightarrow%20%28a%2Ca%29%20%5Cin%20R)
Here we need to prove:
![\forall (a, b) \in A \Rightarrow ((a,b), (a,b)) \in R](https://tex.z-dn.net/?f=%5Cforall%20%28a%2C%20b%29%20%5Cin%20A%20%5CRightarrow%20%28%28a%2Cb%29%2C%20%28a%2Cb%29%29%20%5Cin%20R)
As per the given relation:
which is true.
R is reflexive.
2. Now, let us check symmetric property:
Symmetric property means:
![\forall \{a,b\} \in A\ if\ (a,b) \in R \Rightarrow (b,a) \in R](https://tex.z-dn.net/?f=%5Cforall%20%5C%7Ba%2Cb%5C%7D%20%5Cin%20A%5C%20if%5C%20%28a%2Cb%29%20%5Cin%20R%20%5CRightarrow%20%28b%2Ca%29%20%5Cin%20R)
Here we need to prove:
![\forall {(a, b),(c,d)} \in A \ if\ ((a,b),(c,d)) \in R \Rightarrow ((c,d),(a,b)) \in R](https://tex.z-dn.net/?f=%5Cforall%20%7B%28a%2C%20b%29%2C%28c%2Cd%29%7D%20%5Cin%20A%20%5C%20if%5C%20%28%28a%2Cb%29%2C%28c%2Cd%29%29%20%5Cin%20R%20%5CRightarrow%20%28%28c%2Cd%29%2C%28a%2Cb%29%29%20%5Cin%20R)
As per the given relation:
means ![ad = bc](https://tex.z-dn.net/?f=ad%20%3D%20bc)
means ![cb = da\ or\ ad =bc](https://tex.z-dn.net/?f=cb%20%3D%20da%5C%20or%5C%20ad%20%3Dbc)
Hence true.
R is symmetric.
3. R to be transitive, we need to prove:
![if ((a,b),(c,d)),((c,d),(e,f)) \in R \Rightarrow ((a,b),(e,f)) \in R](https://tex.z-dn.net/?f=if%20%28%28a%2Cb%29%2C%28c%2Cd%29%29%2C%28%28c%2Cd%29%2C%28e%2Cf%29%29%20%5Cin%20R%20%5CRightarrow%20%28%28a%2Cb%29%2C%28e%2Cf%29%29%20%5Cin%20R)
means
.... (1)
means
...... (2)
To prove:
To be
we need to prove: ![fa = be](https://tex.z-dn.net/?f=fa%20%3D%20be)
Multiply (1) with (2):
![adcf = bcde\\\Rightarrow fa = be](https://tex.z-dn.net/?f=adcf%20%3D%20bcde%5C%5C%5CRightarrow%20fa%20%3D%20be)
So, R is transitive as well.
Hence proved that R is an equivalence relation.