- p是質數
- p=3(mod 4)
herrDeng網內搜尋
自訂搜尋
Ads
訂閱:
張貼留言 (Atom)
熱門文章
-
11!=?
-
請問你所使的電腦,CPU的規格 Cache多大?其他硬體配置...... 另外, "INTEL® XEON PHI™ 處理器 7230F"的大致規格為?
-
請輸出如下 * ** *** **** ***** ******
-
請用 for, array算出費式數列 其中 f[0]=f[1]=1, f[n]=f[n-1]+f[n-2] 或公式解 f(n)=1/sqrt(5)((1+sqrt(5))/2)^(n+1)-1/sqrt(5)((1-sqrt(5))/2)^(n+1)
-
計算gcd(123456789,999999999)
-
用random產生double陣列10個元素 排序
-
寫一個是否上學期成績2/3的程式
-
請用C/C++ 程式計算 S=1*1+2*2+3*3+4*4+.....+20*20=?
-
將後序算式計算答案 18,6,/,3,2,*,-
-
產生50個元素的陣列並排序
28 則留言:
package ex01;public class b10133007 { static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); //int m1=(int)Math.sqrt(p); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }}
public class ex_01 { static boolean isPrime(int n){ if(n<1||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0;n<=500;n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(k); }}
public class ex29 { static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; }} System.out.println(); System.out.println(k); }
}
public class ec { static boolean isPrime(int n){ if(n<1||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m;i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0;n<=500;n++){ if(isPrime(n) && n%4==3){ System.out.print(n+","); k++; } } System.out.print(k); }}
public class GG1 { static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; }return true; }
public static void main(String[] args) { int p=0; for(int n=0; n<=500; n++){ if(isPrime(n) && n%4==3){ System.out.print(n+","); p++; } } System.out.println(p); }
}
public class ex1120 { static boolean isPrime(int n){ if(n<1 || n==1) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int x=0; for(int n=0; n<=500; n++) { if(isPrime(n)&&n%4==3){ System.out.print(n+","); x++; } } System.out.println(); System.out.println(x); }}
public class ex1 { static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; }return true; }
public static void main(String[] args) { int p=0; for(int n=0; n<=500; n++){ if(isPrime(n) && n%4==3){ System.out.print(n+","); p++; } } System.out.println(p); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class ex2 {
static boolean isPrime(int n){
if(n<1 ||n==1)return false;
int m= (int)Math.sqrt(n);
for (int i=2;i<m; i++){
if(n%i==0)return false;
}
return true;
}
public static void main (String[] args){
int x=0;
for(int n=0; n<=500;n++){
if(isPrime(n)&&n%4==3){
System.out.print(n+",");
x++;
}
}
System.out.println();
System.out.println(x);
}
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello567 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello1567 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class ex2 { static boolean isPrime(int n){ if(n<1 ||n==1)return false; int m= (int)Math.sqrt(n); for (int i=2;i<=m; i++){ if(n%i==0)return false; } return true; } public static void main (String[] args){ int x=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); x++; } } System.out.println(); System.out.println(x); }}
public class ec { static boolean isPrime(int n){ if(n<1||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m;i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0;n<=500;n++){ if(isPrime(n) && n%4==3){ System.out.print(n+","); k++; } } System.out.print(k); }}
public class ex3 { static boolean abc(int n){ if(n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(abc(n)){ System.out.print(n+","); z++;} } System.out.println(); System.out.println(z); }}
public class ex3 { static boolean abc(int n){ if(n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(abc(n)){ System.out.print(n+","); z++;} } System.out.println(); System.out.println(z); }}
public class ZZZZZ { static boolean xas(int n){ if(n<4||n==1)return false ; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; }return true ; } public static void main(String[] args) { int z=0; for (int n=0;n<=500;n++){ if(xas( n)){z++; System.out.print(n+",");} }System.out.println();System.out.println(z); }}
public class ex3 { static boolean abc(int n){ if(n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(abc(n)){ System.out.print(n+","); z++;} } System.out.println(); System.out.println(z); }}
public class ex3 { static boolean abc(int n){ if(n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(abc(n)){ System.out.print(n+","); z++;} } System.out.println(); System.out.println(z); }}
public class dd { static boolean isPrime(int n){ if (n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0 || n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(isPrime(n)){ System.out.print(n+","); z++; } } System.out.println(); System.out.println(z); } }
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class ex3 { static boolean abc(int n){ if(n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(abc(n)){ System.out.print(n+","); z++;} } System.out.println(); System.out.println(z); }}
public class hello {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
張貼留言