<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Math :: Converter Tools</title><link>https://converter.tools/calculators/math/index.html</link><description>Quadratic solver, factorial, GCD/LCM, prime check.</description><generator>Hugo</generator><language>en-us</language><atom:link href="https://converter.tools/calculators/math/index.xml" rel="self" type="application/rss+xml"/><item><title>Quadratic Equation Solver</title><link>https://converter.tools/calculators/math/quadratic-solver/index.html</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://converter.tools/calculators/math/quadratic-solver/index.html</guid><description>Solve ax² + bx + c = 0. Example: a=1, b=-3, c=2 → x = 1 or 2. Real or complex roots. Copy result.</description></item><item><title>Factorial Calculator</title><link>https://converter.tools/calculators/math/factorial/index.html</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://converter.tools/calculators/math/factorial/index.html</guid><description>Calculate n! (n factorial). Example: 5! = 120. Enter non-negative integer. Copy result.</description></item><item><title>GCD and LCM Calculator</title><link>https://converter.tools/calculators/math/gcd-lcm/index.html</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://converter.tools/calculators/math/gcd-lcm/index.html</guid><description>Find greatest common divisor (GCD) and least common multiple (LCM) of two integers. Example: 12, 18 → GCD 6, LCM 36. Copy result.</description></item><item><title>Prime Number Checker</title><link>https://converter.tools/calculators/math/prime-check/index.html</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://converter.tools/calculators/math/prime-check/index.html</guid><description>Check if a number is prime. Example: 17 → Yes, prime. Shows small factors if composite. Copy result.</description></item></channel></rss>