Numeric Search for the Inverse Factorial
Author: shiroeExecutions: 17
※ This library was created by a member. This site is not responsible for its content.
| L | (n such that n! < x) |
| H | (n such that x < n!) |
| L! value | |
| H! value | |
| x | (Repeated input values) |
| M | (n such that x = n!) |
| M! values | (x should be M!) |
--------------------------------------------------------------------
The values L and H are also output as a reference in case M cannot be found.
--------------------------------------------------------------------
This implementation does not use the modulus formula (related to Fermat’s Little Theorem) or the extended Euclidean algorithm.
It performs a brute-force search using a loop.
--------------------------------------------------------------------
When handling large numbers, please pay attention to the exponential display format (E) in the output field.
--------------------------------------------------------------------
Digit display set to 50 digits. The number of digits can be changed. Real number calculation mode.
The values L and H are also output as a reference in case M cannot be found.
--------------------------------------------------------------------
This implementation does not use the modulus formula (related to Fermat’s Little Theorem) or the extended Euclidean algorithm.
It performs a brute-force search using a loop.
--------------------------------------------------------------------
When handling large numbers, please pay attention to the exponential display format (E) in the output field.
--------------------------------------------------------------------
Digit display set to 50 digits. The number of digits can be changed. Real number calculation mode.
No customer feedback for this calculation yet.
For natural numbers greater than or equal to 2, find the values of x such that x = n!.
Let M be the value of n such that x = n!.
Output the values of L, M, and H, as well as L!, M!, and H!,
such that the following inequalities hold: L < M < H and L! < M! < H!.