User Profile
Collapse
-
-
Thant you I try it -
Please help my.Insorrect result.
Please help my.My program is running but print in
"System.out.pri ntln(firstprime .findPrime ());" isn't
correct.It prin except string primenumbers some other
number for example 16 or 64(it isn't primenumbers).
I thynk that problem is in method "testIsPrim e"
but I cannot find it.
/**
*PrimeNumber.ja va
*
*
*
* To change this template, choose... -
Please help
I have error in System.out.prin tln(firstprime. findPrime ()); I don't know how
it repair.Please hepl me with it.
**
*PrimeNumber.ja va
*
*
*
* To change this template, choose Tools | Template Manager
* and open the template in the editor.
*/
package TestPrime;
/**
*
* @author lm
*/
public class PrimeNumber{... -
Please help me somebody.I want all method print in main.I don't know haw to do it.Leave a comment:
-
Print method
I need modify first program.In second program I try print method findPrime in method main.I have there anywhere mistakes.Please obout help.
First program:
**
*PrimeNumber.ja va
*
*
*
* To change this template, choose Tools | Template Manager
* and open the template in the editor.
*/
package TestPrime;
/**
*... -
-
I want only discart multiple of prime numbers before second loop = i*i
I don't know how to do it in array.Leave a comment:
-
How it improve
I made this program test prime.
I want it improve I have idea but I don’t now how it insert in into program.
Howe somebody else idea?
My idea: if(prime[i]==true)
i*i==false;
Thank for your help
public class testPrime{
public static void main(String[] args) {
int limit = 1000;
int i,j;
boolean... -
-
-
Wrong result
When I debug this isn’t mistakes.
When I start it this is one mistake.
Give me somebody advises please
public static void main(String[] args) {
int limit=1000;
boolean []prime=new boolean[limit+1];
prime[2]=true;
for(int i=2;i<=limit;i+ +)
{
prime=true;
if(i<2||(i%2==0 ))
prime=false;
for(int j=2;j<=limit-1;j++){... -
-
-
I need modify this code.
for(int pp=2;pp<100;pp+ +) //pp=possible prime
{
for(int pd=2;pd<pp;pd++ ) //pd=possible divisor
{
if(pp%pd==0)
break;
}
if(pp==pd)
System.out.prin tln(pp);
}Leave a comment:
-
prime numbers
Hello,I neead help with simple program in java.First test prime numbers with use array and second with use two method,thank.
Simi.
No activity results to display
Show More
Leave a comment: