fork download
copy 
  1. // Check if a number is prime or not
  2.  
  3. import java.util.*;
  4. public class Main{
  5. public static void main(String[] args){
  6. int num = 29;
  7. boolean isPrime= true;
  8.  
  9. for(int i = 2; i<= Math.sqrt(num); i++){
  10. if(num % i == 0){
  11. isPrime = false;
  12. break;
  13. }
  14. }
  15.  
  16. if(isPrime=true){
  17. System.out.println(num + " is a prime");
  18. }
  19. else{
  20. System.out.println(num + " is not a prime");
  21. }
  22. }
  23. }
  24.  
  25.  
Success #stdin #stdout 0.09s 53564KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
29 is a prime
https://ideone.com/VMONoK
language:
Java (HotSpot 12)
created:
4 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!