NumEval 1.1.1
dotnet add package NumEval --version 1.1.1
NuGet\Install-Package NumEval -Version 1.1.1
<PackageReference Include="NumEval" Version="1.1.1" />
paket add NumEval --version 1.1.1
#r "nuget: NumEval, 1.1.1"
// Install NumEval as a Cake Addin
#addin nuget:?package=NumEval&version=1.1.1
// Install NumEval as a Cake Tool
#tool nuget:?package=NumEval&version=1.1.1
Notable features include: -adding, subtracting, multiplying and dividing numbers with as many decimals as you want. -finding exact results for roots (when they exist). -trigonometry functions with more precison. -logarithms with more precision. -roots with more precision. -deterministic prime detection.
For instructions on how to use NumEval visit: http://noob.software/support/#index/app_instructions#3&
Product | Versions Compatible and additional computed target framework versions. |
---|---|
.NET Framework | net is compatible. |
-
- Peachpie.App (>= 0.9.500)
- Peachpie.Library (>= 0.9.500)
- Peachpie.Library.Scripting (>= 0.9.500)
- Peachpie.Runtime (>= 0.9.500)
NuGet packages
This package is not used by any NuGet packages.
GitHub repositories
This package is not used by any popular GitHub repositories.
Version | Downloads | Last updated |
---|
-Minor bugfixes.
-Performance improvements in prime detection, prime factoring and shortening fractions.
-new functions include binary modulus, binary subtraction, binary addition, binary multiplication, (negative binary numbers are not supported)
-When using the prime function to determine primality of individual values you can pass to the function the closest known prime lower than the value being determined which will make determining the primality of the value much faster. The third parameter "weak" can be used to make the function weaker but faster, which can be useful for factoring or finding likely primes.
-NumEval now has three functions to determine primality of a value, the new prime function which seems to be fully deterministic, but has only been tested to a certain point. The old NumEval prime function: prime_alt, which is fully deterministic. And another deterministic test, Pollard's Rho: prime_p.