Research:Algorithm to determine if two numbers are coprime
Methods edit
1. Take two input numbers, let's call them num1 and num2.
2. Calculate the Pochhammer symbol or rising factorial using the following formula: pochhammer = (num1/num2) * ((num1/num2) + 1)
3. Check if the pochhammer is divisible by both num1 and num2 without any remainder. If it is, then the numbers are coprime. Otherwise, they are not coprime.
4. To check for divisibility, calculate the remainder when pochhammer is divided by num1 and num2 separately. remainder1 = numerator of pochhammer % num1 remainder2 = denominator pochhammer % num2
5. If either remainder1 or remainder2 is not equal to zero, then the numbers are not coprime. Otherwise, they are coprime.
Here's a translation of the given example: (127/27) * ((127/27) + 1) = 19558/729 19558/127 = 154 (no remainder) 729/27 = 27 (no remainder) Therefore, both numbers are coprime. (889/189) * ((889/189) + 1) = 19558/729 19558/889 = 22 (no remainder) 729/189 = 3.85... (remainder exists) Therefore, the numbers are not coprime.
Timeline edit
Please provide in this section a short timeline with the main milestones and deliverables (if any) for this project.
Policy, Ethics and Human Subjects Research edit
It's very important that researchers do not disrupt Wikipedians' work. Please add to this section any consideration relevant to ethical implications of your project or references to Wikimedia policies, if applicable. If your study has been approved by an ethical committee or an institutional review board (IRB), please quote the corresponding reference and date of approval.
Results edit
Describe the results and their implications here. We encourage you to share preliminary data. Don't forget to make status=complete above when you are done.
Resources edit
Provide links to presentations, blog posts, or other ways in which you disseminate your work.