//WAP to store first 35 odd numbers in an array then print only primes which are between 25 and 50band also print how many primes are present whivh are not between out of range given above.
public class Program
{
public static void main(String[] args) {
int a[]=new int [35],c=1;
for(int i=0;i<35;i++){
a[i]=c;
c+=2;
}
int k=0,p=0;
for(int i=0;i<=35;i++){
for(int j=1;j<=a[i];j++){
if(a[i]%j==0)
p++;
}
if((p==2)&&((a[i]>25)&&(a[i]<50)))
System.out.println(a[i]);
else if((p==2)&&(!(a[i]>25)&&(a[i]<50)))
k++;
}
System.out.println("No. of primes out of range:-"+k);
}
}
public class Main {
public static void main(String[] args) {
int a[]=new int[35];
int i,count=0;
a[0]=1;
for(i=1;i<a.length;i++) {
a[i]=a[i-1]+2;
}
System.out.print("Prime numbers between 25 and 50 are: ");
for(int j : a) {
int c=0;
for(i=1;i<=j;i++) {
if(j%i==0)
c++;
}
if(c==2) {
if(j>25&&j<50)
System.out.print(j+" ");
else
count++;
}
}
System.out.print("\nPrime numbers not in range: "+count);
}
}
Mr.AnonmyousProgrammer Try this. Previous code has some logical errors.
