Difference between revisions of "Jadhav Division Axiom"
m (Added a category) |
(Formatting) |
||
Line 1: | Line 1: | ||
− | '''Jadhav Division Axiom''' | + | '''Jadhav Division Axiom''' is a method of predicting the number of digits before decimal point in a common fraction, derived by [[Jyotiraditya Jadhav]] |
== Statement == | == Statement == | ||
− | |||
− | + | For any fraction <math>\frac{m}{n}</math>, where <math>n \cdot 10^{k-1} < m < n \cdot 10^{k}</math>, when expressed as a decimal, there are <math>k</math> digits after the decimal point. | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
== Uses == | == Uses == | ||
− | * All | + | * All types of division processes |
* Can be used to correctly predict the nature of the answer for long division processes. | * Can be used to correctly predict the nature of the answer for long division processes. | ||
* Can be used to determine the sin and cosine functions of extreme angles | * Can be used to determine the sin and cosine functions of extreme angles | ||
− | + | [[category:Axioms]] | |
− | + | {{stub}} | |
− | |||
− | |||
− | |||
− | |||
− |
Revision as of 15:46, 14 February 2025
Jadhav Division Axiom is a method of predicting the number of digits before decimal point in a common fraction, derived by Jyotiraditya Jadhav
Statement
For any fraction , where
, when expressed as a decimal, there are
digits after the decimal point.
Uses
- All types of division processes
- Can be used to correctly predict the nature of the answer for long division processes.
- Can be used to determine the sin and cosine functions of extreme angles
This article is a stub. Help us out by expanding it.