Download your PDF
Relatively Prime Numbers result sheet — free, supported by sponsors. Your download button appears in 20 seconds.
This free download is supported by sponsors — continuing in
20
Your file is generated in your browser when you choose Download — nothing is uploaded. If this calculator returns enough numeric data, the export also includes its best-fit chart alongside the readable table.
WorldCalculate result export
Relatively Prime Numbers — result sheet
Find the greatest common divisor, least common multiple, and Bézout coefficients to test whether two integers are coprime.
Inputs used
Results
Visual chart
Breakdown
Calculation steps
Returned data table
Formula and methodology
Formula: gcd(a,b) = 1 means a and b are relatively prime; ax + by = gcd(a,b); lcm(a,b) = |ab|/gcd(a,b).
Two integers are relatively prime when their only positive common divisor is 1. The extended Euclidean algorithm supplies coefficients that reconstruct the greatest common divisor, while the least common multiple shows the size of their shared periodic cycle.
This result follows the calculator's declared inputs, precision, validation boundaries, and model limits.
Input contract
- First integer a — minimum -1000000000; maximum 1000000000
- Second integer b — minimum -1000000000; maximum 1000000000
Worked example
| Input | Value |
|---|---|
| First integer a | 35 |
| Second integer b | 64 |
Relatively prime; gcd 1, lcm 2,240
Assumptions and limits
- Inputs are integers and are not both zero.
- The gcd is reported as nonnegative and the lcm as nonnegative.
- Bézout coefficients are one valid pair, not the only possible pair.
Calculator note
Source and methodology
Use the official WorldCalculate methodology policy for the source, formula, precision, and boundary standards behind this calculator.
Planning estimate, not financial, medical, legal, or professional advice. © WorldCalculate — reuse with attribution. Built and curated by Hassan ALRowaie.
No saved result was found. Please run the calculation first, then choose Download again.