Anonymous user
Hickerson series of almost integers: Difference between revisions
Hickerson series of almost integers (view source)
Revision as of 19:28, 10 August 2020
, 3 years agoadded whitespace, add a reference to a MathWorld entry, noting the formula numbered 51 for ease of location, corrected a misspelling.
(→{{header|Wren}}: Added a second version using BigRat.) |
m (added whitespace, add a reference to a MathWorld entry, noting the formula numbered 51 for ease of location, corrected a misspelling.) |
||
Line 1:
{{task}}
The following function, due to D Hickerson, is said to generate "Almost integers" by the
<br>[http://mathworld.wolfram.com/AlmostInteger.html "Almost Integer" page of Wolfram MathWorld], (December 31 2013). (See formula numbered '''51'''.)
The function is: <math>h(n) = {\operatorname{n}!\over2(\ln{2})^{n+1}}</math>
It is said to produce "almost integers" for '''n''' between '''1''' and '''17'''.
The purpose of the task is to verify this assertion.
Assume that an "almost integer" has '''either a nine or a zero as its first digit after the decimal point''' of its decimal string representation
The task is to calculate all values of the function checking and stating which are "almost integers".▼
;Task:
▲
Note: Use extended/arbitrary precision numbers in your calculation if necessary to ensure you have adequate precision of results as for example:
h(18) = 3385534663256845326.39...
<br><br>
=={{header|Ada}}==
| |||