⭐
Of course it works on localhost always!
gcd(an + b, bn + a) = gholds for all integers n ⩾ N . (Note that gcd(x, y) denotes the greatest common divisor of integers xand y.)
- I ♥ Open Source
- Somewhere in Jupiter
- https://www.linkedin.com/in/farukalkaya
- @farukalkaya
Highlights
PinnedLoading
- BenchmarkDotNet
BenchmarkDotNet PublicForked fromdotnet/BenchmarkDotNet
Powerful .NET library for benchmarking
C#
- EventStore
EventStore PublicForked fromkurrent-io/KurrentDB
The open-source, functional database with Complex Event Processing in JavaScript.
C#
- Hangfire
Hangfire PublicForked fromHangfireIO/Hangfire
An easy way to perform background job processing in your .NET and .NET Core applications. No Windows Service or separate process required
C#
- MarkdownEditor
MarkdownEditor PublicForked frommadskristensen/MarkdownEditor
A Visual Studio extension
C#
- MediatR
MediatR PublicForked fromjbogard/MediatR
Simple, unambitious mediator implementation in .NET
C#
Something went wrong, please refresh the page to try again.
If the problem persists, check theGitHub status page orcontact support.
If the problem persists, check theGitHub status page orcontact support.
Uh oh!
There was an error while loading.Please reload this page.