|
|
| (3 intermediate revisions by one other user not shown) |
| 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>.
| + | {{delete|blank page}} |
| − | | |
| − | == Historical Note ==
| |
| − | [[Jyotiraditya Jadhav]] is a school student and is always curious about [https://www.ck12.org/book/ck-12-middle-school-math-concepts-grade-7/section/1.2 numerical patterns] which fall under the branch of [[Number Theory]]. He formulated many [https://en.wikipedia.org/wiki/Arithmetic 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 equation]]s he found out this numerical pattern and organized the [[theorem]] over it.
| |
| − | | |
| − | == Proof ==
| |
| − | Now let us take <math>\frac{ax^2+bx+c}{x} </math> written as <math>\frac{x[ax+b]+c}{x} </math>
| |
| − | | |
| − | To cancel out <math>x </math> from the denominator we need <math>x </math> in numerator and to take <math>x </math> as common from whole quadratic equation we need to have <math>c </math> as a composite number made up as prime-factors with at least one factor as <math>x </math> or in other words <math>c </math> should be a multiple of <math>x </math> and hence telling us <math>x </math> 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 [https://issuu.com/jyotiraditya123/docs/jadhav_prime_quadratic_theorem here on Issuu]
| |
| − | | |
| − | {{delete|lacks notability}} | |
