# Is it a Sphenic Number?

A Sphenic Number is a number that is the product of exactly three distinct primes. The first few Sphenic numbers are 30, 42, 66, 70, 78, 102, 105, 110, 114. This is sequence A007304 in the OEIS.

Write a program or function to determine whether an inputted integer is a Sphenic number.

## Input:

An integer between 0 and 10^9, which may or may not be a Sphenic Number.

## Output:

A truthy/falsy value indicating whether the input is a Sphenic Number.

## Examples:

30  -> true
121 -> false
231 -> true
154 -> true
4   -> false
402 -> true
79  -> false
0   -> false
60  -> false
64  -> false
8   -> false
210 -> false


## Scoring:

This is , shortest code in bytes wins.

• Is 60 a sphenic number? 2 × 2 × 3 × 5 – Erik the Outgolfer Jul 23 '17 at 15:30
• @EriktheOutgolfer that's not the product of 3 distinct primes though, that's the product of 3 distinct and 1 duplicate prime. – Rɪᴋᴇʀ Jul 23 '17 at 15:31
• @Riker I'm not really sure if "3 distinct primes" means "3 primes that are all distinct" or "when uniquified there should remain 3 primes". EDIT: Oh I see, 60 isn't a sphenic number. (waiting for OP clarification) – Erik the Outgolfer Jul 23 '17 at 15:32
• @EriktheOutgolfer According to the definition of sphenic numbers, 60 is not one of them. I do not know however if 60 is valid for this challenge. – Sriotchilism O'Zaic Jul 23 '17 at 15:59
• @WheatWizard, 60 is not a sphenic number (e.g. output/return falsy). – Gryphon Jul 23 '17 at 18:31

# Brachylog, 6 3 bytes

ḋ≠Ṫ


Try it online!

### Explanation

ḋ        The prime factorization of the Input…
≠       …is a list of distinct elements…
Ṫ      …and there are 3 elements

• And then there's the one language which has a builtin like ≠. – Erik the Outgolfer Jul 24 '17 at 16:24
• And the builtin Ṫ as well. – Zacharý Jul 25 '17 at 18:17
• @Zacharý Ṫ is not really a built-in predicate though; it is a built-in variable: a list of 3 variable elements. It's a fairly useful pre-constrained variable in many different challenges. – Fatalize Jul 26 '17 at 6:33
• Congratulations on the shortest answer. – Gryphon Jul 28 '17 at 11:56

## bash, 43 bytes

factor $1|awk '{print$2-$3&&$3-$4&&NF==4}'  Try it online! Input via command line argument, outputs 0 or 1 to stdout. Fairly self-explanatory; parses the output of factor to check that the first and second factors are different, the second and third are different (they're in sorted order, so this is sufficient), and there are four fields (the input number and the three factors). # MATL, 7 bytes _YF7BX=  ### Explanation _YF % Implicit input. Nonzero exponents of prime-factor decomposition 7 % Push 7 B % Convert to binary: gives [1 1 1] X= % Is equal? Implicit display  • @Suever I was thinking about that, but then falsy ouput becomes uglier (either empty with error or an array with some zeros). Not sure if I should... – Luis Mendo Jul 23 '17 at 16:02 • X= is the saddest builtin I've ever seen. – Erik the Outgolfer Jul 23 '17 at 16:25 # C, 88781265877 73 + 4 (lm) = 77 bytes l,j;a(i){for(l=1,j=0;l++<i;fmod(1.*i/l,l)?i%l?:(i/=l,j++):(j=9));l=i==1&&j==3;}  Ungolfed commented explanation: look, div; //K&R style variable declaration. Useful. Mmm. a ( num ) { // K&R style function and argument definitions. for ( look = 1, div = 0; // initiate the loop variables. look++ < num;) // do this for every number less than the argument: if (fmod(1.0 * num / look, look)) // if num/look can't be divided by look: if( !(num % look) ) // if num can divide look num /= look, div++; // divide num by look, increment dividers else div = 9; // if num/look can still divide look // then the number's dividers aren't unique. // increment dividers number by a lot to return false. // l=j==3; // if the function has no return statement, most CPUs return the value // in the register that holds the last assignment. This is equivalent to this: return (div == 3); // this function return true if the unique divider count is 3 }  Try it online! • Consider i*1.0/l instead of the cast to float. (And since l,j are global they are initialized to 0 for free, you don't need to do that if the function is only called once. Not sure what the rule is for that.) – Mat Jul 24 '17 at 17:43 • 76 bytes – ceilingcat Dec 7 '18 at 23:19 # CJam, 11 bytes rimFz1=7Yb=  ### Explanation Based on my MATL answer. ri e# Read integer mF e# Factorization with exponents. Gives a list of [factor exponent] lists z e# Zip into a list of factors and a list of exponents 1= e# Get second element: list of exponents 7 e# Push 7 Yb e# Convert to binary: gives list [1 1 1] = e# Are the two lists equal? Implicitly display  # Jelly, 8 bytes ÆEḟ0⁼7B¤  Try it online! Uses Luis Mendo's algorithm. Explanation: ÆEḟ0⁼7B¤ ÆE Prime factor exponents ḟ0 Remove every 0 ⁼7B¤ Equal to 7 in base 2?  # Husk, 6 bytes ≡ḋ3Ẋ≠p  Try it online! Returns 1 for sphenic numbers and 0 otherwise. ### Explanation ≡ḋ3Ẋ≠p Example input: 30 p Prime factors: [2,3,5] Ẋ≠ List of absolute differences: [1,2] ≡ Is it congruent to... ? ḋ3 the binary digits of 3: [1,1]  In the last passage, congruence between two lists means having the same length and the same distribution of truthy/falsy values. In this case we are checking that our result is composed by two truthy (i.e. non-zero) values. # Mathematica, 31 bytes SquareFreeQ@#&&PrimeOmega@#==3&  • Since you're already testing for squarefree-ness, PrimeNu will do just as well as PrimeOmega, and is shorter. – Mark S. Jul 25 '17 at 10:36 # Jelly, 6 bytes ÆE²S=3  Try it online! ### How it works ÆE²S=3 Main link. Argument: n ÆE Compute the exponents of n's prime factorization. ² Take their squares. S Take the sum. =3 Test the result for equality with 3.  # 05AB1E, 7 5 bytes ÓnO3Q  Try it online! Uses Dennis's algorithm. # Actually, 7 bytes w♂N13α=  Try it online! Explanation: w♂N13α= w Push [prime, exponent] factor pairs ♂N Map "take last element" 1 Push 1 3 Push 3 α Repeat = Equal?  # Haskell, 59 bytes f x=7==sum[6*0^(mod(div x a)a+mod x a)+0^mod x a|a<-[2..x]]  Try it online! # J, 15 bytes 7&(=2#.~:@q:)~*  Try it online! ## Explanation 7&(=2#.~:@q:)~* Input: integer n * Sign(n) 7&( )~ Execute this Sign(n) times on n If Sign(n) = 0, this returns 0 q: Prime factors of n ~:@ Nub sieve of prime factors 2#. Convert from base 2 = Test if equal to 7  • Very nice use of ~: and #. An alternative could be (7&(=#.@~:@q:)~*) which I find a little easier to read, but is no shorter. – bob Jul 26 '17 at 3:44 # Dyalog APL, 26 bytes ⎕CY'dfns' ((≢,∪)≡3,⊢)3pco⎕  Try it online! # Ruby, 8149 46 bytes Includes 6 bytes for command line options -rprime. ->n{n.prime_division.map(&:last)==[1]*3}  Try it online! # Python 3, 54 53 bytes lambda n:sum(1>>n%k|7>>k*k%n*3for k in range(2,n))==6  Thanks to @xnor for golfing off 1 byte! Try it online! • You can check squarefreeness with k*k%n rather than n%k**2 – xnor Jul 24 '17 at 5:50 • Right, I only need one failure. Thanks! – Dennis Jul 24 '17 at 6:05 C, 91 102 bytes, corrected (again), golfed, and tested for real this time: <strike>s(c){p,f,d;for(p=2,f=d=0;p<c&&!d;){if(c%p==0){c/=p;++f;if(c%p==0)d=1;}++p;}c==p&&f==2&&!d;}</strike> s(c){int p,f,d;for(p=2,f=d=0;p<c&&!d;){if(c%p==0){c/=p;++f;if(c%p==0)d=1;}++p;}return c==p&&f==2&&!d;}  /* This also works in 93 bytes, but since I forgot about the standard rules barring default int type on dynamic variables, and about the not allowing implicit return values without assignments, I'm not going to take it: p,f,d;s(c){for(p=2,f=d=0;p<c&&!d;){if(c%p==0){c/=p;++f;if(c%p==0)d=1;}++p;}p=c==p&&f==2&&!d;}  (Who said I knew anything about C? ;-) Here's the test frame with shell script in comments: /* betseg's program for sphenic numbers from */ #include <stdio.h> #include <stdlib.h> #include <limits.h> #include <math.h> /* compile with -lm */ /* l,j;a(i){for(l=1,j=0;l<i;i%++l?:(i/=l,j++));l=i==1&&j==3;} */ #if defined GOLFED l,j;a(i){for(l=1,j=0;l++<i;fmod((float)i/l,l)?i%l?:(i/=l,j++):(j=9));l=i==1&&j==3;} #else int looker, jcount; int a( intval ) { for( looker = 1, jcount = 0; looker++ < intval; /* Watch odd intvals and even lookers, as well. */ fmod( (float)intval/looker, looker ) ? intval % looker /* remainder? */ ? 0 /* dummy value */ : ( inval /= looker, jcount++ /* reduce the parameter, count factors */ ) : ( jcount = 9 /* kill the count */ ) ) /* empty loop */; looker = intval == 1 && jcount == 3; /* reusue looker for implicit return value */ } #endif /* for (( i=0;$i < 100; i = $i + 1 )) ; do echo -n at$i; ./sphenic $i ; done */  I borrowed betseg's previous answer to get to my version. This is my version of betseg's algorithm, which I golfed to get to my solution: /* betseg's repaired program for sphenic numbers */ #include <stdio.h> #include <stdlib.h> #include <limits.h> int sphenic( int candidate ) { int probe, found, dups; for( probe = 2, found = dups = 0; probe < candidate && !dups; /* empty update */ ) { int remainder = candidate % probe; if ( remainder == 0 ) { candidate /= probe; ++found; if ( ( candidate % probe ) == 0 ) dups = 1; } ++probe; } return ( candidate == probe ) && ( found == 2 ) && !dups; } int main( int argc, char * argv[] ) { /* Make it command-line callable: */ int parameter; if ( ( argc > 1 ) && ( ( parameter = (int) strtoul( argv[ 1 ], NULL, 0 ) ) < ULONG_MAX ) ) { puts( sphenic( parameter ) ? "true" : "false" ); } return EXIT_SUCCESS; } /* for (( i=0;$i < 100; i = $i + 1 )) ; do echo -n at$i; ./sphenic $i ; done */  • Does it answer the question, now? – Joel Rees Jul 24 '17 at 11:42 • Yes, it does. Insert this to link to betseg's answer: [betseg's answer](https://codegolf.stackexchange.com/a/135203/65836). You can also click edit on his answer to suggest an edit to it, if you want, that would include the explanation - no promises on whether it'll be approved or not. – Stephen Jul 24 '17 at 11:43 • I'm here now, and I fixed my program, it's at 87 bytes now; but your program looks good too. – betseg Jul 24 '17 at 13:05 • @betseg Interesting that you used floating point this time. Oh, and thanks for letting me borrow your algorithm. ;-) – Joel Rees Jul 24 '17 at 13:30 • @JoelRees i added explanation to my answer, also your answer has a problem i think? it doesn't seem to work correctly: Try It Online – betseg Jul 24 '17 at 13:41 # Pyth, 9 bytes &{IPQq3lP  Try it here. # Javascript (ES6), 87 bytes n=>(a=(p=i=>i>n?[]:n%i?p(i+1):[i,...p(i,n/=i)])(2)).length==3&&a.every((n,i)=>n^a[i+1])  Example code snippet: f= n=>(a=(p=i=>i>n?[]:n%i?p(i+1):[i,...p(i,n/=i)])(2)).length==3&&a.every((n,i)=>n^a[i+1]) for(k=0;k<10;k++){ v=[30,121,231,154,4,402,79,0,60,64][k] console.log(f(${v}) = ${f(v)}) } # Python 2, 135 121 bytes • Quite long since this includes all the procedures: prime-check, obtain-prime factors and check sphere number condition. lambda x:(lambda t:len(t)>2and t[0]*t[1]*t[2]==x)([i for i in range(2,x)if x%i<1and i>1and all(i%j for j in range(2,i))])  Try it online! # Python 2, 59 bytes lambda x:6==sum(5*(x/a%a+x%a<1)+(x%a<1)for a in range(2,x))  Try it online! • This gives false positives like 48. I had been trying the same thing. – xnor Jul 23 '17 at 18:55 • @xnor Fixed, but at the cost of bytes. – Sriotchilism O'Zaic Jul 23 '17 at 19:07 # J, 23 bytes 0:((~.-:]*.3=#)@q:)@.*  Try it online! Handling 8 and 0 basically ruined this one... q: gives you all the prime factors, but doesn't handle 0. the rest of it just says "the unique factors should equal the factors" and "the number of them should be 3" • This fails for input 60 – Conor O'Brien Jul 23 '17 at 18:57 • @ConorO'Brien thanks. See my edit -- fixing 60 helped, but i realized i also wasn't handling 0 correctly, and handling that more than doubles the bytes – Jonah Jul 23 '17 at 19:14 • The last one was my original idea, and that fails for 8. – Conor O'Brien Jul 23 '17 at 19:21 • I have (6=]#@,~.)@q: as a possible solution – Conor O'Brien Jul 23 '17 at 19:22 • @ConorO'Brien ah good point about 8. yours will fail for 0, though. – Jonah Jul 23 '17 at 19:31 # Japt, 14 bytes k k@è¥X ÉÃl ¥3  Try it online! • @Oliver That would result in passing a function to Number.k(), which would have no effect and just check if the input has 3 prime factors, not 3 distinct prime factors. That would mean 8 (with three prime factors: 2, 2, 2) would pass despite not being in A007304 – Justin Mariner Jul 24 '17 at 20:00 • Ah, you're right. I was just going by the test cases. – Oliver Jul 24 '17 at 20:05 • @Oliver Yeah, that really threw me for a loop when working on this solution. I just added 8 to the test cases for that reason. – Justin Mariner Jul 24 '17 at 20:09 # Mathematica, 44 bytes Plus@@Last/@#==Length@#==3&@FactorInteger@#&  Try it online! # VB.NET (.NET 4.5), 104 bytes Function A(n) For i=2To n If n Mod i=0Then A+=1 n\=i End If If n Mod i=0Then A=4 Next A=A=3 End Function  I'm using the feature of VB where the function name is also a variable. At the end of execution, since there is no return statement, it will instead pass the value of the 'function'. The last A=A=3 can be thought of return (A == 3) in C-based languages. Starts at 2, and pulls primes off iteratively. Since I'm starting with the smallest primes, it can't be divided by a composite number. Will try a second time to divide by the same prime. If it is (such as how 60 is divided twice by 2), it will set the count of primes to 4 (above the max allowed for a sphenic number). Try It Online! # Dyalog APL, 5149484645 43 bytes 1∊((w=×/)∧⊢≡∪)¨(⊢∘.,∘.,⍨){⍵/⍨2=≢∪⍵∨⍳⍵}¨⍳w←⎕  Try it online! (modified so it can run on TryAPL) I wanted to submit one that doesn't rely on the dfns namespace whatsoever, even if it is long. # J, 1514 19 bytes Previous attempt: 3&(=#@~.@q:)~* Current version: (*/*3=#)@~:@q: ::0: # How it works: (*/*3=#)@~:@q: ::0: Input: integer n ::0: n=0 creates domain error in q:, error catch returns 0 q: Prime factors of n ~:@ Nub sieve of prime factors 1 for first occurrence 0 for second (*/*3=#)@ Number of prime factors is equal to 3, times the product across the nub sieve (product is 0 if there is a repeated factor or number of factors is not 3)  This passes for cases 0, 8 and 60 which the previous version didn't. • why not 3=#~.q: for 7characters? From a J session 3=#~.q: 30 ==> 1 and 3=#~.q: 20 ==> 0 – Richard Donovan Jul 25 '17 at 19:24 • Richard, your suggestion gives a false positive for n=60 and creates a domain error for n=0, but my previous version failed for n=60 as well. Your comment prompted me to strive for a correct solution! – bob Jul 26 '17 at 3:14 # Mathematica, 66 57 bytes Length@#1==3&&And@@EqualTo[1]/@#2&@@(FactorInteger@#)&  Defines an anonymous function.  is Transpose. ## Explanation FactorInteger gives a list of pairs of factors and their exponents. E.g. FactorInteger[2250]=={{2,1},{3,2},{5,3}}. This is transposed for ease of use and fed to the function Length@#1==3&&And@@EqualTo[1]/@#2&. The first part, Length@#1==3, checks that there are 3 unique factors, while the second, And@@EqualTo[1]/@#2 checks that all the exponents are 1. # PHP, 66 bytes: for($p=($n=$a=$argn)**3;--$n;)$a%$n?:$p/=$n+!++$c;echo$c==7&$p==1;  Run as pipe with -nR or try it online. Infinite loop for 0; insert $n&& before --$n to fix. breakdown for($p=($n=$a=$argn)**3; #$p = argument**3
--$n;) # loop$n from argument-1
$a%$n?:                     # if $n divides argument$p/=$n # then divide$p by $n +!++$c;                     # and increment divisor count
echo$c==7&$p==1;            # if divisor count is 7 and \$p is 1, argument is sphenic


example
argument = 30:
prime factors are 2, 3 and 5
other divisors are 1, 2*3=6, 2*5=10 and 3*5=15
their product: 1*2*3*5*6*10*15 is 27000 == 30**3

# Python 99 bytes

def s(n):a,k=2,0;exec('k+=1-bool(n%a)\nwhile not n%a:n/=a;k+=10**9\na+=1\n'*n);return k==3*10**9+3


First submission. Forgive me if I did something wrong. Kinda silly, counts the number of factors of n, and then the number of times n is divisible by each (by adding 10**9).

I'm pretty sure there are a few easy ways to cut off ~10-20 characters, but I didn't.

Also this is intractably slow at 10**9. Could be made okay by changing '...a+=1\n'*n to '...a+=1\n'*n**.5, as we only need to go to the square root of n`.