public static function isPrime($bits, $algo = 'forte') {
		$pcs = new PitchClassSet($bits);
		return $pcs->bits == $pcs->primeFormRing();
	}
public static function isPrime($bits, $algo = 'forte') {
		$pcs = new PitchClassSet($bits);
		return $pcs->bits == $pcs->primeFormRing();
	}
public static function isPrime ( $ bits , $ algo = 'forte' ) { $ pcs = new PitchClassSet ( $ bits ) ; return $ pcs -> bits == $ pcs -> primeFormRing ( ) ; }
Drawing a line in the electrons here, declaring that our "isPrime" method will use the Ring method, which
produces identical results as the Rahn formula. Apologies to Forte.
@param  [type]  $bits [description]
@param  string  $algo [description]
@return boolean       [description]
Drawing a line in the electrons here declaring that our isPrime method will use the Ring method which produces identical results as the Rahn formula . Apologies to Forte .