I was inspired by
this Reddit thread to see if I could supplement the traditional regex primality test with a regex Euclidean algorithm. Here's the shortest one that occurred to me; it takes the two numbers (assumed to be positive integers) whose GCD we want to compute in
$a and
$b:
(1 x $a) =~ /(?:$1)*(.*)/ and ($a, $b) = ($b, length $1) while $b
At the end,
$a is the GCD (and
$b is
0). Life's even better if we're allowed to start with
$a and
$b strings of
1s of the desired length, and leave our answer in
$a in the same form:
($a, $b) = ($b, $a =~ /(?:$1)*(.*)/) while $b
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.