returned for Tags:"prime-factorization"
Methods and extensions for prime number detection and discovery.
Part of the "Open" set of libraries.
2,732 total downloads
Written in F# as reusable prime number generation.
MIT license open source:
ILMerge.MSBuild.Tasks' is a fork of ilmerge-tasks:
ILMerge Tasks for MSBuild but with the SetTargetPlatform
Library containing a UInt128 class, and extensions to .Net's built in integral data types.
The version targeting .Net 4.5 is implemented as a Portable Class Library.
The methods in this library were written with speed in mind. UInt128 operations are generally much faster than BigInteger.
CSparse.NET provides numerical methods for sparse LU, Cholesky and QR decomposition of real and complex linear systems.
An API to check if a number is prime using fermat's little theorem
> ISBN10 generator
> ISSN generator
> prime numbers generator
> text bullshit generator
> labyrinth generator
The package is the result of the continuous improvement of prime-dev.net team in the development with the microsoft.net libraries.
MathExtensions is a library for .NET that aims to provide useful extensions methods regarding various mathematical domains, like combinatorics, sequence analysis, sequence generation, sequence manipulation, random extractions, etc.
A .NET library that helps with mathematics and algorithmic work.
IPuresharp urbanize libraries with strategic private code to lay transparent foundations for Puresharp API .NET
Puresharp is a Framework that provides the essential APIs to productively build high quality (.NET 4.5.2+ & .NET Core 2.1+) applications through reliability, scalability and performance without