Booth Id:
MATH001T
Category:
Mathematics
Year:
2024
Finalist Names:
Chomakhidze, Giorgi (School: Georgian-American School)
Kuloshvili, Nikolozi (School: Georgian-American School)
Nazgaidze, Aleksandre (School: Georgian-American School)
Abstract:
Math helps us in solving physical, biological, chemical and everyday problems which require the use of high degree polynomial equations. Unfortunately, solving these types of equations is not a part of the school program. In school, students only learn how to solve quadratic equations with the discriminant. Out of the high degree polynomial equations we only study specific 4th degree equations called biquadratic equations with the form: ax4 + bx2 + c = 0, where we change the variable with z, where z=x2
This project aims to create an innovative iterative algorithm (using C++) to solve polynomials with rational roots (not those with roots of irrational or imaginary numbers)
Bezout's theorem states that when dividing P(x) polynomial by (x-a) we will get a remainder of R.
P(x) = (x-a) g(x) + R
Result 1: x=a is a solution to P(x) only and only if, P(x) gets divided by x-a binomial without a remainder
Result 2: If an=1 and the polynomial coefficients are whole numbers, and constant term a0 is divided by the solution, then, every rational solution is a whole number.
Let’s discuss this nth degree equation:
anxn + an-1xn-1 +…+ a2x2+a1x + a0 =0 where x is the variable and an , ... , a0 are whole numbers.
Let’s say a rational number x=p/q is a solution, which is an irreducible fraction, where: q is divisor of an, and p is the divisor of a0.
In this project we will apply our algorithm to solve several representative equations, such as:
X4-7x3+7x2+35x-60=0. We write the set of divisions of constant term a0=-60
Instead of x we put the elements from M. If it satisfies the equation, we divide the polynomial by (x-x1) binomial.
(X4-7x3+7x2+35x-60):(x-3)=x3-4x2-5x+20
We reduce the degree of the equation by 1 and we repeat this process until we get a quadratic equation.