Return whether the number is semiprime. public static boolean isPQ(long.number) { return true; } Solution This is what i have any queries please comment public static boolean isPQ(long number) { if (number == || number == || number == ) { return true; } int increase = 1; if (!((int)number % 2 == 0)) { increase = 2; } ArrayList<Integer> factors = new ArrayList<Integer>(); for (int i = 1; i <= (int)number/2; i = i + increase) { if ((int)number % i == 0) { factors.add(i); } factors.add((int)number); } if (!(factors.size() == 4)) { return false; } for (int i2 = 0; i2 < factors.size() - 1; i2++) { int factor = factors.get(i2); if (!(isPrime(factor))) { return false; } } return true; } .

1. Return whether the number is semiprime.
public static boolean isPQ(long.number) {
return true;
}
Solution
This is what i have any queries please comment
public static boolean isPQ(long number)
{
if (number == || number == || number == )
{
return true;
}
int increase = 1;
if (!((int)number % 2 == 0))
{
increase = 2;
}
ArrayList<Integer> factors = new ArrayList<Integer>();
for (int i = 1; i <= (int)number/2; i = i + increase)
{
if ((int)number % i == 0)
{
factors.add(i);
}
factors.add((int)number);
}
if (!(factors.size() == 4))
{
return false;
}

2. for (int i2 = 0; i2 < factors.size() - 1; i2++)
{
int factor = factors.get(i2);
if (!(isPrime(factor)))
{
return false;
}
}
return true;
}