Jadhav Prime Quadratic Theorem
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 
.
Theorem
It states that if a Quadratic Equation is divided by then it gives the answer as an Integer if and only if is equal to 1, Prime Factors and composite divisor of the constant 
.
Let the set of prime factors of constant term be represented as ![$p.f.[c]$](http://latex.artofproblemsolving.com/2/4/f/24f7db09513a1d0a18bbce3552e7378d9f3d9c7e.png)
and the set of all composite divisor of be ![$d[c]$](http://latex.artofproblemsolving.com/c/1/9/c19da214f0c45b9871099584d4d1264429895702.png)
Iff 
![$p.f.[c] \bigcup d[c] \bigcup {1}$](http://latex.artofproblemsolving.com/d/8/6/d86c886ce3ea5c8fc234dd32921f883078a728f7.png)
where 
.
Historical Note
Jyotiraditya Jadhav is a school-student and is always curious about numerical patterns which fall under the branch of Number Theory. He formulated many arithmetic based equations before too like Jadhav Theorem, Jadhav Triads, Jadhav Arithmetic Merging Equation and many more. While he was solving a question relating to Quadratic Equations he found out this numerical pattern and organized the theorem over it.
Proving "Jadhav Prime Quadratic Theorem"
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
