My Project Euler code, in C#
-
Updated
Nov 24, 2017 - C#
My Project Euler code, in C#
Creates a counting system of radixes such as base 12 or mixed radixes such as Minutes/Hours/Days/Years (60/60/24/365)
Two RC4 stream cipher variants for hashing, CBC, visualizing how it works, or just general encryption. Includes 2 variants: A simple table with a method to visualize the permutation state of the table and the avalanche effect as a bitmap, and a more serious attempt at a secure encryption scheme. NOTE: PROBABLY NOT ACTUALLY SECURE, SO DO NOT TRUS…
Topos is a library for implementations of mathematical concepts for .NET environment. Based on Zermelo–Fraenkel set theory (ZFC).
A simple implementation of Euler's Totient Function for NeosVR
Command line calculator for number theory operations (primes, factorization, multiplicative functions, etc.)
This is an implementation designed in C#. This implementation is able to mix two signals/vectors (A and B) in arbitrary proportions. This source code uses a novel mathematical model published in the journal Chaos. The model is called Spectral Forecast.
Fast, hybrid, probabilistic, cryptographically-random, equi-distributed C# prime finding application
Algorithm for evaluating any given number and determine if it's either primary or no primary. This program is my solution to chapter one of Brilliant.org "Algorithm Fundamentals" Course.
naive quadratic sieve implementation https://www.ams.org/notices/199612/pomerance.pdf
Программная реализация криптоалгоритма на основе эллиптических кривых / Implementation of cryptoalgorithm based on elliptic curves
The solution done by me in C# on the challenge "Hamming Numbers" over at www.codewars.com
A complete, proof-of-concept, C# implementation of the General Number Field Sieve algorithm for factoring very large semi-prime numbers. The focus was on readability and understandability of the code, not performance.
The solution done by me in C# on the challenge "Binary multiple of 3" over at www.codewars.com
A very fast async parallel generator for big/large prime numbers. Several prime numbers can be generated simultaneously via the bit or digit length.
Aplicación GUI y CLI en C# para calcular reglas de divisibilidad
Add a description, image, and links to the number-theory topic page so that developers can more easily learn about it.
To associate your repository with the number-theory topic, visit your repo's landing page and select "manage topics."