Just a simple little project that simplifies non-square rootable square root equations. HOW IT WORKS: Takes your radicand (ex: √(8), so 8), and look through a list of the first 200,000 perfect squares besides 1 and 0, and looks to see if your radicand is divisible by any of those perfect squares starting at the closest one to your number. Then if it IS divisible by a square root, it divides your radicand by the number (ex: 8 is divisible by 4 so it outputs 4, and 2, because that is the leftover), and now there are 2 square root numbers (ex: √(4)*√(2)), still the same equation just separated into a perfect square, and a non perfect square. So you find the square root of the first number (ex: √(4) is 2) and then you shove it in front of the non-square rootable one (ex: 2*√(2) or just 2√(2)) then its done! That is how to simplify a none square rootable number. This is usually done so you can divide a non square rootable number, by another number (ex: √(8) usually isn't divisible by 2, but if you simplify it into 2√(2), you can divide by 2 and be left with √(2)), at least from my experience. EXAMPLES: Input(54), Output(3√(6)) Input(8), Output(2√(2)) Input(456), Output(2√(114)) Input(3456), Output(24√(6)) Input(12), Output(2√(3)) Input(4536), Output(18√(14))
@Hotdawg_Coder - Did everything
