Scipione del Ferro solved the "Depressed Cubic" equations.
Tartaglia claimed he solved it(But it is just a copyright infringement)
Having a bet with Antonio Fior in solving this type of equations, he took a long time solving all 30 questions.
Problem is that this type of equations are really hard to solve. View the full method in solving "Depressed Cubic" equations online.
I'm going to introduce a more layman way of solving this type of equations.
Factorise out from left hand side of the equation and find out the factors for n.
Substitute in the factors and make sure both sides of the equation matches. Solve for
Note that this approach only works when the polynomial equation has an integer root. It is a result of (but not equivalent to) the rational root theorem.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
How do you solve the "simplest" case x3+x=1?
Your method only works if there is an integer solution.
Log in to reply
Yes. Only for integers.