Content deleted Content added
m Archiving 1 discussion(s) to Talk:Methods of computing square roots/Archive 1) (bot |
→"nearest perfect square" in Bakhshali method?: new section |
||
Line 58:
:Obviously, articles about a particular language are an exception.
:In this article, it appears that the three examples are in [[C (programming language)]]. But we do ''not'' guarantee that they will work as written. [[User:JRSpriggs|JRSpriggs]] ([[User talk:JRSpriggs|talk]]) 00:38, 8 January 2020 (UTC)
== "nearest perfect square" in Bakhshali method? ==
The example in the Bakhshali method has me published. The initial guess is said to be "''x''<sub>0</sub><sup>2</sup> be the initial approximation to ''S''." The example uses <math>S = 125348</math>, and chooses <math> x_0 = 600 </math>. How can that be? <math>600^2 = 360000</math> and there are many perfect squares closer to ''S'', like 400 or 350.
How is the initial guess ''really'' meant to be chosen? Unfortunately, the material here (in particular, this example) isn't well-referenced enough to explain how 600 meets the criteria given in the article. -- [[User:Mikeblas|Mikeblas]] ([[User talk:Mikeblas|talk]]) 21:06, 26 February 2020 (UTC)
| |||