VibeMaths 1.0.0

VibeMaths

A C# math library powered entirely by vibes.
Why ask your CPU when you could ask an LLM?

What is VibeMaths?

VibeMaths is a small C# library that let's you delegate all of your mathematical operations to an AI.
Instead of letting the CPU compute numbers the boring way, VibeMaths asks an LLM:
"Hey, what’s 2 + 2?"*

*VibeMaths does not actually phrase questions like that.

Perfect for:

• Replacing deterministic computing with probabilistic vibes.
• etc.

Usage Examples

Basic features

using VibeMaths;

class Program
{
    static void Main()
    {
        var vm = new VibeMathematician("your-openai-api-key");

        // Basic arithmetic
        var sum = vm.Add(2, 2); // Might be 4

        // Comparisons
        bool greater = vm.GreaterThan(10, 3); // True (unless vibes disagree)

        // Trigonometry
        var sine = vm.Sin(Math.PI / 2); // Ideally 1

        Console.WriteLine($"2 + 2 = {sum}, 10 > 3? {greater}, sin(π/2) = {sine}");
    }
}

For loops

using VibeMaths;

class Program
{
    static void Main()
    {
        var vm = new VibeMathematician("your-openai-api-key");

        for (int i = 0; vm.LessThan(i, 10); i = vm.Add(i, 1)) // Way faster to type than a normal for loop
        {
            Console.WriteLine(vm.Add(i, 1)); // Counts from 1 to 10, probably
        }
    }
}

Finding prime numbers

using VibeMaths;

class Program
{
    static void Main()
    {
        var vm = new VibeMathematician("your-openai-api-key");

        List<int> primes = [2];
        int current = 3;

        Console.WriteLine("2"); // Write out the first prime number

        while (vm.Equal(0, 0)) // The proper way to write while (true).
        {
            for (int i = 0; vm.LessThan(i, primes.Count); i = vm.Add(i, 1))
            {
                // Check if current is divisible by any of the primes found so far
                if (vm.Equal(vm.Modulo(current, primes[i]), 0))
                {
                    break;
                }
                // If there are no factors after reaching the end, it is a prime number
                if (vm.Equal(i, vm.Subtract(primes.Count, 1)))
                {
                    primes.Add(current);
                    Console.WriteLine(current);
                }
            }
            current = vm.Add(current, 2); // Increment by 2 to check only odd numbers
        }
    }
}