harika.jo
0
Newbie Poster
Recommended Answers
Jump to Postfollow these steps:
1. let say you need to findout all the primes till number n
2. create a outer for loop which will iterate from 1 to n (let say int i)
3. create a inner for loop(int j) and chk i%j
4. for prime numbers i%j will be …
Jump to PostOr
private boolean is_prime(int n) { for(int i=2; n<i*i; i++) { if(i*i==n) { return true; } /* or if(n%i==0) { return true; } */ } return false; } /* main */ int num = 123; for(int i=2; i<num; i++) { if(is_prime(i)==true) { System.out.println(i); } }
But this …
All 5 Replies
vchandra
3
Junior Poster in Training
Krstevski
7
Junior Poster
stultuske
1,116
Posting Maven
Featured Poster
aspire1
36
Light Poster
stultuske
1,116
Posting Maven
Featured Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.