Find whether two numbers are mutually prime (coprime)
Release： 2016-07-25 08:48:27
Original
1676 people have browsed it
Use the euclidean method to find out whether two numbers are prime numbers (prime numbers)
- $a=200;
- $b=13;
- //Euclidean division method
- if($b>$a){
- $x=$a;$a=$b;$ b=$x;
- }
- while(1){
- //echo "a=".$a." b=".$b;echo "n";
- if($b==1){echo " Reciprocally prime";break;}
- if($b==0){echo "Not reciprocally prime";break;}
- if($a-$b > $b){
- $a=$a-$b ;
- }else{
- $a=$a-$b;
- $x=$a;$a=$b;$b=$x;
- }
- }
- ?>
|
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Latest Articles by Author
-
2024-10-22 09:46:29
-
2024-10-13 13:53:41
-
2024-10-12 12:15:51
-
2024-10-11 22:47:31
-
2024-10-11 19:36:51
-
2024-10-11 15:50:41
-
2024-10-11 15:07:41
-
2024-10-11 14:21:21
-
2024-10-11 12:59:11
-
2024-10-11 12:17:31
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
