Difference between revisions of "Jadhav Division Axiom"
(Formatting) |
(Proposed for deletion) |
||
| Line 3: | Line 3: | ||
== 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 | + | 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 before the decimal point. |
== Uses == | == Uses == | ||
| Line 9: | Line 9: | ||
* All types of division processes | * 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 | + | * Can be used to determine the sine and cosine functions of extreme angles |
| − | |||
| − | |||
{{stub}} | {{stub}} | ||
| + | {{delete|not notable}} | ||
Latest revision as of 16:16, 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 before 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 sine and cosine functions of extreme angles
This article is a stub. Help us out by expanding it.
| This article has been proposed for deletion. The reason given is: not notable
Sysops: Before deleting this article, please check the article discussion pages and history. |
