## Trigonometry – Solve tan (x) + cos (x) = 1/2 – Mathematics Stack Exchange

Is it possible (not numerical) to find that? $$x$$ such as:

$$tan (x) + cos (x) = 1/2$$

?

All my attempts are finished in a 4-degree polynomial. Example: Calling c = cos (x):

$$frac { sqrt {1-c ^ 2}} {c} + c = frac {1} {2}$$

$$sqrt {1-c ^ 2} + c ^ 2 = frac {1} {2} c$$

$$1-c ^ 2 = c ^ 2 ( frac {1} {2} -c) ^ 2 = c ^ 2 ( frac {1} {4} -c + c ^ 2)$$

$$c ^ 4-c ^ 3 + frac {5} {4} c ^ 2-1 = 0$$

## Complexity Theory – If there is no known polynomial time algorithm to solve the B-reduced A and A poly time, there is no known polynomial time algorithm to solve B

Is the statement below true or false and please give me a little explanation.

If there is no known polynomial time algorithm to solve A and A ≤ pB, there is no known polynomial time algorithm to solve B.

I think wrong, but I'm not sure.
Many Thanks!

## Differential equations – How do you solve these ODEs with NDSolve?

The calculation changes t = 0 there sin[ψ

 eq1 = ω1 eq2 = ω2 and construct the linear combinations, eq1n = Simplify[eq1Sin[eq1Sin[eq1Sin[eq1Sin[ψ (* Cos[ψ (If this were not possible, the equations themselves could not be solved in principle.) Now replace eq1, eq2 by eq1n, eq2n, I1 = 2; I2 = 3; I3 = 4; s = NDSolveValue[{I1*ω1&#39;[{I1*ω1'[{I1*ω1'[{I1*ω1' I2 * ω2 & # 39; I3 * ω3 & # 39; eq1n == 0, eq2n == 0, ω3 ω1[0] == 2, ω2[0] == 3, ω3[0] == 4, ψ[0] == 0, φ[0] == 0, θ[0] == Pi / 6}, {ω1 plot[Evaluate@s[[1 ;; 3]], {t, 0, 120}, ImageSize -> Large]plot[Evaluate@s[[4 ;; 6]], {t, 0, 120}, ImageSize -> Large] Incidentally, the original equations can be solved by slightly changing the initial state ψ[0] == 0 to ψ[0] == 10 ^ -6, Another approach is to use the option. Method -> {"EquationSimplification" -> "Residual"} Everyone gives the same answer. 
 
 Author AdminPosted on March 17, 2019Categories ArticlesTags differential, equations, NDSolve, ODEs, solve 
 How do I solve these Odes with NDSolve? I have six odes and can not use DSolve. So I tried NDSolve. But it does mean that there may be mistakes. The code looks like this: I1 = 2; I2 = 3; I3 = 4; NDSolve[{I1*ω1' I2 * ω2 & # 39; I3 * ω3 & # 39; 0, ω1[ t] == φ & # 39; sin[ψ[ψ[ψ[ψ t] == φ & # 39; cos[ψ[ψ[ψ[ψ t] == φ & # 39; 0] == 2, ω2[0] == 3, ω3[0] == 4, ψ[0] == 0, φ[0] == 0, θ[0] == Pi / 6}, {ω1, ω2, ω3, ψ, φ, θ}, {t, 0, 120}] I want to know how to avoid this mistake. Author AdminPosted on March 17, 2019Categories ArticlesTags NDSolve, ODEs, solve To solve basic problems with asymptotic algorithms Thank you for your response to the Mathematics Stack Exchange! Please be sure answer the question, Provide details and share your research! But avoid … Ask for help, clarification or answers to other answers. Make statements based on opinions; secure them with references or personal experiences. Use MathJax to format equations. Mathjax reference. For more information, see our tips for writing great answers. Author AdminPosted on March 16, 2019Categories ArticlesTags Algorithms, Asymptotic, basic, Problems, solve Equation Solution – Solve a nonlinear system with eight variables Please I need urgent help We consider the three functions H1 = 4 (x + b1y) ^ 2 + 8 (c1x-d1y) + e1 ^ 2 y ^ 2, where e1> 0 H2 = 4 (x + b2y) ^ 2 + 8 (c2x-d2y) + e2 ^ 2 y ^ 2 with e2> 0 H3 = 4 (x + b3y) ^ 2 + 8 (c3x-d3y) + e3 ^ 2 y ^ 2 with e3> 0 … d1, b1, c1, d2, c2, b2, d3, c3, b3 are real Parameter. I would like to solve the following system (to get the values ​​of alpha, beta, gamma, delta, f, h, g, k) or (if that is not possible) to specify the maximum number of its solutions The system is E1 = E2 = E3 = E4 = E5 = E6 = E7 = E8 = 0, so that E1 = H1 (alpha, beta) -H1 (gamma, delta), E2 = H2 (alpha, beta) -H2 (f, g), E3 = H2 (gamma, delta) -H2 (h, k), E4 = H3 (h, k) -H3 (f, g), E5 = beta ^ 2-alpha (alpha-1) (alpha-3), E6 = delta ^ 2-gamma (gamma-1) (gamma-3), E7 = g ^ 2-f (f-1) (f-3), E8 = k ^ 2-h (h-1) (h-3). Author AdminPosted on March 16, 2019Categories ArticlesTags equation, nonlinear, Solution, solve, system, variables Solve inheritance without affecting data consistency in a relational database In trying to make the database better, I noticed that I am always tempted to solve variations of the same problem. Here is an example with general requirements: An online store sells various categories of product, The system must z. For example, you can get the list of all product categories foods and Furniture, A customer can order and retrieve each product assignment History. The system must store certain properties depending on the product category. say that expiration date and calories for each foods Product and manufacturing date for each Furniture Product. Without requirement 4, the model could be quite straightforward: Problem is the attempt to solve requirement 4. I thought of something like this: In this approach, the product furniture and product food relationship is a supertype subtype relationship; The primary key of the subtype is also a foreign key for the supertype primary key. However, this approach can not guarantee category referenced by a foreign key product will match the actual subtype. For example, nothing prevents me from hiring foods Category to a product tuple with a subtype record in the Furniture Table. I've read several articles on inheritance in relational database modeling, especially these and these, which were very helpful but did not solve my problem for the reasons mentioned above. Regardless of which model I come from, I am never satisfied with the consistency of the data. How can I solve requirement 4 without compromising data consistency? Did I go wrong here? If so, what would be the best way to solve this problem based on these requirements? Author AdminPosted on March 15, 2019Categories ArticlesTags affecting, Consistency, data, database, Inheritance, relational, solve Algorithms – If I can solve Sudoku, can I solve TSP? Suppose that you give a program a partially filled sudoku, you get a completed sudoku. Can you treat this program as a black box and solve this problem to solve TSP? I mean, is there a way to present the TSP problem as a partially filled sudoku, so if I give you the answer to that sudoku, you can find the polynomial solution for TSP? Author AdminPosted on March 15, 2019Categories ArticlesTags Algorithms, solve, Sudoku, TSP How To Solve Over-Redirected WordPress | Forum Promotion about us Forum Promotion is a webmaster forum focused on internet marketing to help webmasters and administrators make their website successful. With Forum Promotion you can increase your website by advertising in our directory, buying free advertisements or closing stock exchanges. In our discussion area you can also get advice from experienced webmasters. Author AdminPosted on March 14, 2019Categories ArticlesTags Forum, OverRedirected, Promotion, solve, WordPress Why does Solve block trying to solve the quardatic equation with large integers? Why is Solve blocking when trying to solve Solve?[(x^2+y^2)+(x+y)==2^256 && x>0 && y>0,{x,y},Integers]? It works 2 ^ 185, but at higher powers of 2, processing seems to stop. The program says it works, but there is no solution if it runs overnight. Running Mathematica 11.3 on Windows 32-bit operating system. Author AdminPosted on March 10, 2019Categories ArticlesTags Block, equation, integers, large, quardatic, solve Posts navigation Page 1 Page 2 … Page 16 Next page