int num1=19000;
int num=num1;
int index = 0;
int[] arr=new int[num];
for (int i = 2; i <=num; i++) {
if(num%i==0){
arr[index]=i;
index++;
}
while(num%i==0) {
num=num/i;
}
}
int sum=0;
for (int i =1; i <num1; i++) {
boolean sign=true;
for (int j = 0; j <index; j++) {
if(i%arr[j]==0) {
sign=false;
break;
}
}
if(sign) {
sum++;
}
}
System.out.println(sum);
}## 不大于19000的正整数与19000,互质的个数是多少?
04-21
781
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
02-02
978
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
11-10
8735
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
01-18
1772
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)