Verify Whether or not a Quantity is an Anti Prime Quantity(Extremely Composite Quantity)
[ad_1]
Given a constructive integer N, the duty is to inform whether or not it’s an antiprime quantity or not.
AntiPrime Numbers (Extremely Composite Quantity):
A constructive integer that has extra divisors than any constructive quantity smaller than it, is known as an AntiPrime Quantity (also referred to as Extremely Composite Quantity).
Following is the checklist of the primary 10 antiprime numbers together with their prime factorizations:
AntiPrime Quantity Prime Factorization 1 2 2 4 2^{2} 6 2×3 12 2^{2}×3 24 2^{3}×3 36 2^{2}×3^{2} 48 2^{4}×3 60 2^{2}×3×5 120 2^{3}×3×5
Examples:
Enter: N = 5040
Output: 5040 is antiprime
Rationalization: There is no such thing as a constructive integer lower than 5040 having
variety of divisors greater than or equal to the variety of divisors of 5040.Enter: N = 72
Output: 72 just isn’t antiprime
Strategy:
This query may be solved by counting the variety of divisors of the present quantity after which counting the variety of divisors for every quantity lower than it and checking whether or not any quantity has the variety of divisors higher than or equal to the variety of divisors of N.
Observe the steps to unravel this downside:
 Discover what number of components this quantity has.
 Now iterate until N1 and verify
 Does any quantity lower than the quantity has components extra or equal to the quantity
 If sure, then the quantity just isn’t an antiprime quantity.
 If in the long run not one of the numbers have the variety of divisors higher than or equal to the variety of divisors of N, then N is an antiprime quantity.
Under is the implementation of the above strategy.
Java

Time Complexity: O(N^{3/2})
Auxiliary Area: O(1)
[ad_2]