Re: fibonacci regex


The stupid question is the question not asked
	PerlMonks

by TedYoung (Deacon)

on Jan 25, 2005 at 15:39 UTC ( #424900=note: print w/replies, xml )

Need Help??

Nice, this reminds me of a function to test if a number if prime:

sub isPrime {
  ('1' x $_[0]) !~ /^(11+)\1+$/;
}
[download]

Ted Young

($$<<$$=>$$<=>$$<=$$>>$$) always returns 1. :-)

Comment on Re: fibonacci regex Select or Download Code

Replies are listed 'Best First'.
Re^2: fibonacci regex by ambrus (Abbot) on May 10, 2010 at 19:27 UTC
See also prime factorization using base 1 for the original source, and Re: Simple primality testing.	[reply]

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://424900]
help

Chatterbox^?

How do I use this? | Other CB clients

Other Users^?

Others lurking in the Monastery: (1)

As of 2023-09-28 15:41 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

No recent polls found

Notices^?