What do you think?
Rate this book
256 pages, Paperback
First published January 1, 1968
Mathematicians do not always state the obvious.
It is one of the curious coincidences that occur in the history of mathematics that a problem about rabbits should generate a sequence of numbers of such interest and fascination. Rabbits, needless to say, do not feature again in its history.
Arithmetical sums may be checked by the process called ‘casting out nines’. This came to Europe from the Arabs, but was probably an Indian invention. Leonardo of Pisa described it in his Liber Abaci. Each number in a sum is replaced by the sum of its digits. If the original sum is correct, so will the same sum be when performed with the sums-of-digits only.
39
This appears to be the first uninteresting number, which of course makes it an especially interesting number, because it is the smallest number to have the property of being uninteresting.
It is therefore also the first number to be simultaneously interesting and uninteresting.
0.010309 278350 515463 917525 773195…
641
Euler found the first counter-example to Fermat’s conjecture that 2^2^n + 1 is always prime, when he discovered in 1742 that 2^2^5 +1 is divisible by 641.
#!/usr/local/bin/python3
# calculate pi using David Wells, p. 55
from sys import argv, exit
from decimal import Decimal, getcontext
from argparse import ArgumentParser
parser = ArgumentParser(description="calculate pi")
parser.add_argument('precision', type=int, nargs='?', default=5)
parser.add_argument('--verbose', action='store_true')
arguments = parser.parse_args()
getcontext().prec = arguments.precision
d1,d2,d4,d6 = Decimal(1), Decimal(2), Decimal(4), Decimal(6)
a=d1
x=d1
b=d1/d2.sqrt()
c=d1/d4
previousPi = d1
while True:
y=a
a=(a+b)/d2
b=(b*y).sqrt()
c=c-x*(a-y)**d2
x=d2*x
pi = (a+b)**d2/(d4*c)
#leave loop if pi has stopped changing
if pi == previousPi:
break
previousPi = pi
if arguments.verbose:
print(pi)
print(pi)