Simultaneous trigonometric equations

  • Thread starter Thread starter John O' Meara
  • Start date Start date
  • Tags Tags
    Trigonometric
John O' Meara
Messages
325
Reaction score
0
I am looking for help in solving a pair of simultaneous equations. I have not come across any maths book that solves trigonometric ones. I was wondering if I could get a step by step solution. Thanking you in advance for your time:

5.4=10cos(x) + 13.41cos(y) ....(i)
0=10sin(x) + 13.41sin(y) .....(ii)
 
Physics news on Phys.org
Express "cos y" in terms of "cos x" using the II-nd equation and the relationship between the "sin" and the "cos".

Daniel.
 



Hi there,

Solving simultaneous trigonometric equations can be challenging, but with the right approach, it can be done. I would be happy to help you with the pair of equations you have provided.

First, let's rearrange the equations to make them easier to work with:

(i) 10cos(x) + 13.41cos(y) = 5.4
(ii) 10sin(x) + 13.41sin(y) = 0

Next, we can use the Pythagorean identity (sin^2(x) + cos^2(x) = 1) to eliminate one of the variables. Let's square both sides of equation (ii) and substitute the value of sin^2(x) with (1-cos^2(x)):

100cos^2(x) + 267.5881sin^2(y) = 0
100cos^2(x) + 267.5881(1-cos^2(y)) = 0
100cos^2(x) + 267.5881 - 267.5881cos^2(y) = 0
100cos^2(x) - 167.5881cos^2(y) = -267.5881

Now, we can substitute this value into equation (i) and solve for cos(x):

10cos(x) + 13.41cos(y) = 5.4
10cos(x) + 13.41(1 - sin^2(y)) = 5.4
10cos(x) + 13.41 - 13.41sin^2(y) = 5.4
10cos(x) + 13.41 - 13.41(1 - cos^2(y)) = 5.4
10cos(x) - 13.41cos^2(y) = -8.01
10cos(x) = 13.41cos^2(y) - 8.01
cos(x) = (13.41cos^2(y) - 8.01)/10
cos(x) = (13.41cos(y) - 8.01)/10cos(y)

Now, we can substitute this value into equation (ii) and solve for sin(y):

10sin(x) + 13.41sin(y) = 0
10(1 - cos^2(y)) + 13.41
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top