Write a program to print even and prime numbers from 100 to 200 in core java language?

Answer 1

I could write the program quickly, but I want to leave you part of the fun.

Just write a loop for the numbers from 2-100 (1 is not considered a Prime number). Write a second loop to test divisibility of each number, "n", with all factors lower than that number (from 2 to n-1). If such a factor exists, the number is NOT a prime number.

To test for divisibility, use the remainder of a division.

if (n % factor == 0)
// If true, it is divisible.

Answer 2

import java.io.*;

class Fun

{

public void even(int m,int n) //prints even numbers

{

for(int i=(m+1);i<n;i++)

{

if(i%2==0)

System.out.println(i);

System.out.println("\n");

}

}

public void prime(int x,int y ) //prints prime numbers

{

for(int j=(x+1);j<y;j++)

{

int f=0;

for(int k=2;k<j/2;k++)

{

if(j%k==0)

{

f=1;

break;

}

}

if(f==0)

{ System.out.println(j);

System.out.println("\n");

}

class exe

{

public static void main (String[] args)

{

Fun h=new Fun();

h.even(100,200);

h.prime(100,200);

}

}

Answer 3

public class PerfectNumber{

public static void main(String[]args){

int sum=0, x=0;

for(int num=1;num<500;num++){

for(int i=1;i

x=num%i;

if(x==0)

sum=sum+i;

}

if(sum==num){

System.out.println("Perfect Number is: "+num);

System.out.println("Factors are: ");

for(int i=1;i

x=num%i;

if(x==0)

System.out.println(i);

}

}

sum=0;

}

}

}

Answer 4

package javaapplication1;

public class JavaApplication1 {

public static boolean is_prime(int val){

if (val<0) val*=-1;

if (val<2) return false;

if (val%2==0) return val==2;

int max = (int)Math.sqrt(val)+1;

for (int div=3; div<max; ++div)

if (val%div==0)

return false;

return true;

}

public static void main(String[] args) {

System.out.print ("List of primes from 0 to 100:\n");

for (int i=0; i<=100; ++i){

if (is_prime(i)) {

System.out.print (i);

System.out.print (" is prime\n");

}

}

}

}

Answer 5

package javaapplication1;

public class JavaApplication1 {

public static boolean is_prime(int val){

if (val<0) val*=-1; // make val positive

if (val<2) return false;

if (val%2==0) return val==2;

int max = (int)Math.sqrt(val)+1;

for (int div=3; div<max; ++div)

if (val%div==0)

return false;

return true;

}

public static void main(String[] args) {

System.out.print ("List of primes from 0 to 100:\n");

for (int i=0; i<=100; ++i){

if (is_prime(i)) {

System.out.print (i);

System.out.print (" is prime\n");

}

}

}

}