Factoring Trinomials So I Don't Have To | C# Online Compiler

Factoring Trinomials So I Don't Have To by Koromaru

/*************************************************************************/
/* Program Name:     MathCheating.cs                                     */
/* Date:             10/27/2020 - 10/28/2020                             */
/* Programmer:       Dylan                                               */
/* Class:            CSCI 231                                            */
/*                                                                       */
/* Program Description:  Factor Ax^2+Bx+C for Me                         */
/*                                                                       */
/* Input:	The A, B, and C    								             */
/*                                                                       */
/* Output:	The Factored Equation   						             */
/*                                                                       */
/* Givens:	All The Math                              		             */
/*                                                                       */
/* Testing Data:                                                         */
/* A = 1: (3x^2+15x+18), (x^2+26x+168), (3x^2+12x+15)                    */
/* A > 1: (12x^2+26x+12), (6x^2+15x+15)                                  */
/* B < 0: (12x^2-26x+12), (12x^2-24+12)                                  */
/* C < 0: (12x^2+10x-12), (12x^2-12)                                     */
/* B < 0 & C < 0: (12x^2-10x-12)                                         */
/* A < 0: (-12x^2+26x-12), (-12x^2+10x+12)                               */
/* Plus a bunch of equations found online at                             */
/* https://www.mesacc.edu/~scotz47781/mat120/notes/factoring/trinomials/a_is_not_1/trinomials_practice.html */
/*************************************************************************/
using System;

public class Madness
{
    static int GCD(int a, int b, int c) //METHOD for finding the GCD of Ax^2+Bx+C
    {
        int gcd = 1; //all numbers are divisble by 1
        int i;       //the default gcd
        int invA = 0 - a; //creates negetive numbers
        int invB = 0 - b; //for when the opposite is needed
        int invC = 0 - c; //and for finding absolute value
        int small; //to find the minimum of more than 2 numbers

        if (b != 0) //checks if there is a b
        {
            //finds minimum absolute value of A, B, and C
            if (Math.Max(a, invA) <= Math.Max(b, invB) && Math.Max(a, invA) <= Math.Max(c, invC)) //checks if a is closest to zero
                small = Math.Max(a, invA); //saves positive a as the smallest
            else if (Math.Max(b, invB) <= Math.Max(c, invC)) //checks if b is closest to zero
                small = Math.Max(b, invB); //saves positive b as the smallest
            else //the only other option is c
                small = Math.Max(c, invC); //saves positive c as the smallest

            for (i = 2; i <= small; i++) //checks all values for gcd
                if (Math.Abs(a) % i == 0 && Math.Abs(b) % i == 0 && Math.Abs(c) % i == 0) //checks if the gcd is valid
                    gcd = i; //saves each posibility of gcd
        }
        else if (b == 0) //deletes the b if there is no b
        {
            for (i = 2; i <= Math.Min(Math.Abs(a), Math.Abs(c)); i++) //checks all values for gcd without b
                if (a % i == 0 && c % i == 0) //checks if the gcd is valid
                    gcd = i; //saves each posibility of gcd without b
        }
        if (a < 0) //if A is negetive
            gcd = 0 - gcd; //Ax^2+Bx+C is divisible by -1 at least

        return gcd; //ends METHOD
    }
    static int SqrtD(int d)
    {
        int min = 0;
        int max;
        double sqrtd = Math.Sqrt(Math.Abs(d));

        do
        {
            max = min + 1;
            if (min < sqrtd && max >= sqrtd)
                break;
            min++;
        } while (max < sqrtd);
        return max;
    }
    static void Ans(int a, int b, int c) //METHOD for factoring (Ax^2+Bx+C)/GCD
    {
        bool stop = false; //stop checker
        int invB = 0 - b; //inverted b
        int invC = 0 - c; //inverted c
        int d = (a * c); //the max limit of either x
        int m = 0; //the second x
        int n = 0; //the first x
        int o = 0; //the first Coefficient
        int p = 0; //the second Coefficient
        int h = 0; //line count
        int i; //temps for first x
        int j; //temps for second x
        int i2 = 0;
        int j2 = 0;
        int k; //temps for first Coefficient
        int l; //temps for second Coefficient

        if (a >= 1) //positive coefficient
        {
            i = (0 - SqrtD(d));
            do//checks all values of the second x
            {
                j = b - i;
                if (stop) //if a solution is found
                    break; //stop finding solutions
                //Thread.Sleep(25); //testing help
                h++; //testing linecount
                //Console.WriteLine($"(x + {j})(x + {i}) = (x^2 + {i + j}x + {j * i})"); //testing help
                if ((i + j) == b && (i * j) == d) //checks if it works
                {
                    //Console.WriteLine("Ax^2 + Bx + C"); //testing help
                    i2 = i; //saves second x / first coefficient
                    j2 = j; //saves first x / second coefficient
                    stop = true; //if a solution is found it stops finding solutions
                }
                /*if (i != 0 && j != 0)
                    if (Math.Abs(c) - Math.Abs(i * j) > 10000)
                        i += 9999;*/
                i++;
            } while (i <= SqrtD(d));
            stop = false;
            //Console.WriteLine("Multiple of X"); //testing help
            for (k = 1; k <= Math.Max(a, Math.Abs(b)); k++)
            {
                if (stop) //if a solution is found
                    break; //stop finding solutions
                for (l = 1; l <= Math.Max(a, Math.Abs(b)); l++)
                {
                    if (stop) //if a solution is found
                        break; //stop finding solutions
                    //Thread.Sleep(25);
                    h++; //testing linecount

                    //Console.WriteLine($"({k}x + {j2 / l})({l}x + {i2 / k}) = ({k * l}x^2 + {j2 + i2}x + {(j2 / l) * (i2 / k)})"); //testing help
                    if ((k * l) == a && (j2 / l) * (i2 / k) == c)
                    {
                        //Console.WriteLine($"a = {a} b = {b} c = {c}"); //testing help
                        //Console.WriteLine($"k = {k} l = {l} j2 = {j2} i2 = {i2} = ({k * l}x^2 + {j2 + i2}x + {(j2 * i2) / (k * l)})"); //testing help 
                        n = j2 / l;
                        m = i2 / k;
                        o = k;
                        p = l;
                        stop = true;
                    }
                }
            }
            int invM = 0 - m; //creates an inverted second x
            int invN = 0 - n; //creates an inverted first x
            if ((o * p) == a && ((m * o) + (n * p)) == b && (m * n) == c) //if a working solution was found
            {
                //Console.WriteLine($"Factored is "); //testing data
                if (o != 1) //check to display first coefficient
                    Console.Write($"({o}x "); //displays first coefficient
                else
                    Console.Write("(x "); //skips first coefficient
                if (n >= 1) //check if first x is positive
                    Console.Write($"+ {n})"); //displays first x as possitive
                else
                    Console.Write($"- {invN})"); //displays first x as negetive
                if (n == m && o == p) //checks if both xs are same
                {
                    Console.WriteLine("^2"); //skips second coefficient and x
                }
                else
                {
                    if (p != 1) //check to display second coefficient
                        Console.Write($"({p}x "); //displays second coefficient
                    else
                        Console.Write("(x "); //skips second coefficient
                    if (m >= 1) //check if second x is positive
                        Console.WriteLine($"+ {m})"); //displays second x as positive
                    else
                        Console.WriteLine($"- {invM})"); //displays second x as negetive
                }
            }
            else //if no solutions were found
            {
                if (a == 1) //check to display a
                    Console.Write("(x^2 "); //skips a
                else
                    Console.Write($"({a}x^2 "); //displays a
                if (b > 1) //check if b is positive
                    Console.Write($"+ {b}x "); //displays b as positive
                else if (b == 1) //check if b is 1
                    Console.Write("+ x "); //doesnt display 1 but displays x
                else if (b <= -1) //check if b is negetive
                    Console.Write($"- {invB}x "); //displays b as negetive
                //if b is zero it doesn't display b
                if (c >= 1) //check if c is positive
                    Console.WriteLine($"+ {c})"); //displays c as positive
                //c cant be zero
                else //check if c is negetive
                    Console.WriteLine($"- {invC})"); //displays c as negetive
            }
            Console.WriteLine($"Tested {h} Combinations"); //testing linecount
            //Console.WriteLine($"M is {m}"); //debugging help
            //Console.WriteLine($"N is {n}"); //debugging help
            //Console.WriteLine($"O is {o}"); //debugging help
            //Console.WriteLine($"P is {p}"); //debugging help
        }
    }
    public static void Main(string[] args)
    {
        //start:; //easy testing loop
        int count = 0;
        int a = 0; //creates a
        int b = 0; //creates b
        int c = 0; //creates c
        bool Auto = false; //auto solve questions
        bool Infinite = false; //infinite auto solving questions
        do
        {

            Console.WriteLine("Ax^2 + Bx + C"); //display equation
            Console.WriteLine("Enter the A, B, C Numbers"); //explains needed input
            Console.WriteLine("Enter all 0 to Exit"); //exit prompt
            Console.WriteLine(); //blank space
            a = int.Parse(Console.ReadLine()); //reads A from Ax^2
            b = int.Parse(Console.ReadLine()); //reads B from Bx
            c = int.Parse(Console.ReadLine()); //reads C
            Console.WriteLine(); //blank space

            if (a == 0 && b == 0 && c == 0) //check to exit
                break;
            if (a == 0) //x^2+Bx+C is auto corrected to 1x^2+Bx+C
                a++; //makes a 1
            if (c == 0) //Ax^2+Bx+0 is auto corrected to Ax^2+C
            {
                c = b; //sets b to c
                b = 0; //"deletes" b
            }
            if (b == 0 && c == 0) //i cant auto correct complete failure
            {
                Console.WriteLine("Please enter an Equation that can be Factored"); //prompt to re-enter equation
                Console.WriteLine(); //blank space
            }
            else
            {
                int invB = 0 - b; //creates inverted b
                int invC = 0 - c; //creates inverted c
                int gcd = GCD(a, b, c); //sends Ax^2+Bx+C to find the GCD
                //Console.WriteLine($"The Greatest Common Denominator is {gcd}"); //displays GCD for testing
                int a2 = (a / gcd); //divids Ax^2+Bx+C by the GCD
                int b2 = (b / gcd); //prepares for factoring
                int c2 = (c / gcd);

                if (a == 1) //checks if Ax is 1x
                    Console.Write("x^2 "); //displays only x
                else
                    Console.Write($"{a}x^2 "); //displays ax positive or negetive
                if (b > 1) //checks if b is positive
                    Console.Write($"+ {b}x "); //displays positive bx
                else if (b == 1) //checks if b is 1
                    Console.Write("+ x "); //displays positive x
                else if (b == -1) //checks if b is -1
                    Console.Write("- x "); //displays negetive x
                else if (b < -1) //checks if b is negetive
                    Console.Write($"- {invB}x "); //displays negetive bx
                //if b is zero it doesnt display
                if (c >= 1) //checks if c is positive
                    Console.Write($"+ {c} "); //displays positive c
                //c cant be zero
                else //if c is negetive
                    Console.Write($"- {invC} "); //displays negetive c
                Console.Write("factored is "); // displays clarifying words
                if (gcd != 1) //checks if gcd isnt default
                    Console.Write($"{gcd}"); //displays gcd
                //Console.WriteLine($"{gcd}({a2}x^2 + {b2}x = {c2})"); //testing data
                Ans(a2, b2, c2); //sends (Ax^2+Bx+C)/GCD to factor
                //Console.WriteLine($"{gcd}"); //testing data
                Console.WriteLine(); //blank space
                //goto start; //easy testing loop
            }
        } while (a != 0 || b != 0 || c != 0); //ends loop if A, B, and C are 0
    }
}

​x
 
/*************************************************************************/
/* Program Name:     MathCheating.cs                                     */
/* Date:             10/27/2020 - 10/28/2020                             */
/* Programmer:       Dylan                                               */
/* Class:            CSCI 231                                            */
/*                                                                       */
/* Program Description:  Factor Ax^2+Bx+C for Me                         */
/*                                                                       */
/* Input:   The A, B, and C                                              */
/*                                                                       */
/* Output:  The Factored Equation                                        */
/*                                                                       */
/* Givens:  All The Math                                                 */
/*                                                                       */
/* Testing Data:                                                         */
/* A = 1: (3x^2+15x+18), (x^2+26x+168), (3x^2+12x+15)                    */
/* A > 1: (12x^2+26x+12), (6x^2+15x+15)                                  */
/* B < 0: (12x^2-26x+12), (12x^2-24+12)                                  */
/* C < 0: (12x^2+10x-12), (12x^2-12)                                     */
/* B < 0 & C < 0: (12x^2-10x-12)                                         */
/* A < 0: (-12x^2+26x-12), (-12x^2+10x+12)                               */
/* Plus a bunch of equations found online at                             */
/* https://www.mesacc.edu/~scotz47781/mat120/notes/factoring/trinomials/a_is_not_1/trinomials_practice.html */
/*************************************************************************/
using System;
​
public class Madness
{
    static int GCD(int a, int b, int c) //METHOD for finding the GCD of Ax^2+Bx+C
    {
        int gcd = 1; //all numbers are divisble by 1
        int i;       //the default gcd
        int invA = 0 - a; //creates negetive numbers
        int invB = 0 - b; //for when the opposite is needed
        int invC = 0 - c; //and for finding absolute value
        int small; //to find the minimum of more than 2 numbers
​
        if (b != 0) //checks if there is a b
        {
            //finds minimum absolute value of A, B, and C
            if (Math.Max(a, invA) <= Math.Max(b, invB) && Math.Max(a, invA) <= Math.Max(c, invC)) //checks if a is closest to zero
                small = Math.Max(a, invA); //saves positive a as the smallest
            else if (Math.Max(b, invB) <= Math.Max(c, invC)) //checks if b is closest to zero
                small = Math.Max(b, invB); //saves positive b as the smallest
            else //the only other option is c
                small = Math.Max(c, invC); //saves positive c as the smallest
​
            for (i = 2; i <= small; i++) //checks all values for gcd
                if (Math.Abs(a) % i == 0 && Math.Abs(b) % i == 0 && Math.Abs(c) % i == 0) //checks if the gcd is valid
                    gcd = i; //saves each posibility of gcd
        }
        else if (b == 0) //deletes the b if there is no b
        {
            for (i = 2; i <= Math.Min(Math.Abs(a), Math.Abs(c)); i++) //checks all values for gcd without b
                if (a % i == 0 && c % i == 0) //checks if the gcd is valid
                    gcd = i; //saves each posibility of gcd without b
        }
        if (a < 0) //if A is negetive
            gcd = 0 - gcd; //Ax^2+Bx+C is divisible by -1 at least
​
        return gcd; //ends METHOD
    }
    static int SqrtD(int d)
    {
        int min = 0;
        int max;
        double sqrtd = Math.Sqrt(Math.Abs(d));
​
        do
        {
            max = min + 1;
            if (min < sqrtd && max >= sqrtd)
                break;
            min++;
        } while (max < sqrtd);
        return max;
    }
    static void Ans(int a, int b, int c) //METHOD for factoring (Ax^2+Bx+C)/GCD
    {
        bool stop = false; //stop checker
        int invB = 0 - b; //inverted b
        int invC = 0 - c; //inverted c
        int d = (a * c); //the max limit of either x
        int m = 0; //the second x
        int n = 0; //the first x
        int o = 0; //the first Coefficient
        int p = 0; //the second Coefficient
        int h = 0; //line count
        int i; //temps for first x
        int j; //temps for second x
        int i2 = 0;
        int j2 = 0;
        int k; //temps for first Coefficient
        int l; //temps for second Coefficient
​
        if (a >= 1) //positive coefficient
        {
            i = (0 - SqrtD(d));
            do//checks all values of the second x
            {
                j = b - i;
                if (stop) //if a solution is found
                    break; //stop finding solutions
                //Thread.Sleep(25); //testing help
                h++; //testing linecount
                //Console.WriteLine($"(x + {j})(x + {i}) = (x^2 + {i + j}x + {j * i})"); //testing help
                if ((i + j) == b && (i * j) == d) //checks if it works
                {
                    //Console.WriteLine("Ax^2 + Bx + C"); //testing help
                    i2 = i; //saves second x / first coefficient
                    j2 = j; //saves first x / second coefficient
                    stop = true; //if a solution is found it stops finding solutions
                }
                /*if (i != 0 && j != 0)
                    if (Math.Abs(c) - Math.Abs(i * j) > 10000)
                        i += 9999;*/
                i++;
            } while (i <= SqrtD(d));
            stop = false;
            //Console.WriteLine("Multiple of X"); //testing help
            for (k = 1; k <= Math.Max(a, Math.Abs(b)); k++)
            {
                if (stop) //if a solution is found
                    break; //stop finding solutions
                for (l = 1; l <= Math.Max(a, Math.Abs(b)); l++)
                {
                    if (stop) //if a solution is found
                        break; //stop finding solutions
                    //Thread.Sleep(25);
                    h++; //testing linecount
​
                    //Console.WriteLine($"({k}x + {j2 / l})({l}x + {i2 / k}) = ({k * l}x^2 + {j2 + i2}x + {(j2 / l) * (i2 / k)})"); //testing help
                    if ((k * l) == a && (j2 / l) * (i2 / k) == c)
                    {
                        //Console.WriteLine($"a = {a} b = {b} c = {c}"); //testing help
                        //Console.WriteLine($"k = {k} l = {l} j2 = {j2} i2 = {i2} = ({k * l}x^2 + {j2 + i2}x + {(j2 * i2) / (k * l)})"); //testing help 
                        n = j2 / l;
                        m = i2 / k;
                        o = k;
                        p = l;
                        stop = true;
                    }
                }
            }
            int invM = 0 - m; //creates an inverted second x
            int invN = 0 - n; //creates an inverted first x
            if ((o * p) == a && ((m * o) + (n * p)) == b && (m * n) == c) //if a working solution was found
            {
                //Console.WriteLine($"Factored is "); //testing data
                if (o != 1) //check to display first coefficient
                    Console.Write($"({o}x "); //displays first coefficient
                else
                    Console.Write("(x "); //skips first coefficient
                if (n >= 1) //check if first x is positive
                    Console.Write($"+ {n})"); //displays first x as possitive
                else
                    Console.Write($"- {invN})"); //displays first x as negetive
                if (n == m && o == p) //checks if both xs are same
                {
                    Console.WriteLine("^2"); //skips second coefficient and x
                }
                else
                {
                    if (p != 1) //check to display second coefficient
                        Console.Write($"({p}x "); //displays second coefficient
                    else
                        Console.Write("(x "); //skips second coefficient
                    if (m >= 1) //check if second x is positive
                        Console.WriteLine($"+ {m})"); //displays second x as positive
                    else
                        Console.WriteLine($"- {invM})"); //displays second x as negetive
                }
            }
            else //if no solutions were found
            {
                if (a == 1) //check to display a
                    Console.Write("(x^2 "); //skips a
                else
                    Console.Write($"({a}x^2 "); //displays a
                if (b > 1) //check if b is positive
                    Console.Write($"+ {b}x "); //displays b as positive
                else if (b == 1) //check if b is 1
                    Console.Write("+ x "); //doesnt display 1 but displays x
                else if (b <= -1) //check if b is negetive
                    Console.Write($"- {invB}x "); //displays b as negetive
                //if b is zero it doesn't display b
                if (c >= 1) //check if c is positive
                    Console.WriteLine($"+ {c})"); //displays c as positive
                //c cant be zero
                else //check if c is negetive
                    Console.WriteLine($"- {invC})"); //displays c as negetive
            }
            Console.WriteLine($"Tested {h} Combinations"); //testing linecount
            //Console.WriteLine($"M is {m}"); //debugging help
            //Console.WriteLine($"N is {n}"); //debugging help
            //Console.WriteLine($"O is {o}"); //debugging help
            //Console.WriteLine($"P is {p}"); //debugging help
        }
    }
    public static void Main(string[] args)
    {
        //start:; //easy testing loop
        int count = 0;
        int a = 0; //creates a
        int b = 0; //creates b
        int c = 0; //creates c
        bool Auto = false; //auto solve questions
        bool Infinite = false; //infinite auto solving questions
        do
        {
​
            Console.WriteLine("Ax^2 + Bx + C"); //display equation
            Console.WriteLine("Enter the A, B, C Numbers"); //explains needed input
            Console.WriteLine("Enter all 0 to Exit"); //exit prompt
            Console.WriteLine(); //blank space
            a = int.Parse(Console.ReadLine()); //reads A from Ax^2
            b = int.Parse(Console.ReadLine()); //reads B from Bx
            c = int.Parse(Console.ReadLine()); //reads C
            Console.WriteLine(); //blank space
​
            if (a == 0 && b == 0 && c == 0) //check to exit
                break;
            if (a == 0) //x^2+Bx+C is auto corrected to 1x^2+Bx+C
                a++; //makes a 1
            if (c == 0) //Ax^2+Bx+0 is auto corrected to Ax^2+C
            {
                c = b; //sets b to c
                b = 0; //"deletes" b
            }
            if (b == 0 && c == 0) //i cant auto correct complete failure
            {
                Console.WriteLine("Please enter an Equation that can be Factored"); //prompt to re-enter equation
                Console.WriteLine(); //blank space
            }
            else
            {
                int invB = 0 - b; //creates inverted b
                int invC = 0 - c; //creates inverted c
                int gcd = GCD(a, b, c); //sends Ax^2+Bx+C to find the GCD
                //Console.WriteLine($"The Greatest Common Denominator is {gcd}"); //displays GCD for testing
                int a2 = (a / gcd); //divids Ax^2+Bx+C by the GCD
                int b2 = (b / gcd); //prepares for factoring
                int c2 = (c / gcd);
​
                if (a == 1) //checks if Ax is 1x
                    Console.Write("x^2 "); //displays only x
                else
                    Console.Write($"{a}x^2 "); //displays ax positive or negetive
                if (b > 1) //checks if b is positive
                    Console.Write($"+ {b}x "); //displays positive bx
                else if (b == 1) //checks if b is 1
                    Console.Write("+ x "); //displays positive x
                else if (b == -1) //checks if b is -1
                    Console.Write("- x "); //displays negetive x
                else if (b < -1) //checks if b is negetive
                    Console.Write($"- {invB}x "); //displays negetive bx
                //if b is zero it doesnt display
                if (c >= 1) //checks if c is positive
                    Console.Write($"+ {c} "); //displays positive c
                //c cant be zero
                else //if c is negetive
                    Console.Write($"- {invC} "); //displays negetive c
                Console.Write("factored is "); // displays clarifying words
                if (gcd != 1) //checks if gcd isnt default
                    Console.Write($"{gcd}"); //displays gcd
                //Console.WriteLine($"{gcd}({a2}x^2 + {b2}x = {c2})"); //testing data
                Ans(a2, b2, c2); //sends (Ax^2+Bx+C)/GCD to factor
                //Console.WriteLine($"{gcd}"); //testing data
                Console.WriteLine(); //blank space
                //goto start; //easy testing loop
            }
        } while (a != 0 || b != 0 || c != 0); //ends loop if A, B, and C are 0
    }
}

View IL Code