Difference between revisions of "Jadhav Prime Quadratic Theorem"
(→Theorem) |
(→Historical Note) |
||
| Line 1: | Line 1: | ||
In Mathematics, '''Jadhav's Prime Quadratic Theorem''' is based on [[Algebra]] and [[Number Theory]]. Discovered by an Indian Mathematician [[Jyotiraditya Jadhav]]. Stating a condition over the value of <math>x</math> in the [[quadratic equation]] <math>ax^2+bx+c</math>. | In Mathematics, '''Jadhav's Prime Quadratic Theorem''' is based on [[Algebra]] and [[Number Theory]]. Discovered by an Indian Mathematician [[Jyotiraditya Jadhav]]. Stating a condition over the value of <math>x</math> in the [[quadratic equation]] <math>ax^2+bx+c</math>. | ||
| − | |||
| − | |||
| − | |||
== Proof == | == Proof == | ||
Revision as of 12:31, 27 February 2025
In Mathematics, Jadhav's Prime Quadratic Theorem is based on Algebra and Number Theory. Discovered by an Indian Mathematician Jyotiraditya Jadhav. Stating a condition over the value of 
in the quadratic equation 
.
Proof
Now let us take 
written as ![$\frac{x[ax+b]+c}{x}$](http://latex.artofproblemsolving.com/b/6/8/b6867beca66c17e4b64e51865f9912bba1c97256.png)
To cancel out from the denominator we need in numerator and to take as common from whole quadratic equation we need to have 
as a composite number made up as prime-factors with at least one factor as or in other words should be a multiple of and hence telling us should at least be a prime factor, composite divisor or 1 to give the answer as an Integer.
Hence Proving Jadhav Prime Quadratic Theorem.
Original Research paper can be found here on Issuu
| This article has been proposed for deletion. The reason given is: lacks notability
Sysops: Before deleting this article, please check the article discussion pages and history. |
