Regular expressions can be made to solve diophantine equations!
Please examine:
# for the equation: 3x + 2y + 10z = 50
($x,$y,$z,$ans) = (3,2,10,50);
$xpat = 0 x $x;
$ypat = 0 x $y;
$zpat = 0 x $z;
if ((0 x $ans) =~ /^ ((?:$xpat)+) ((?:$ypat)+) ((?:$zpat)+) $/x) {
print "x = ", length($1)/$x, "\n";
print "y = ", length($2)/$y, "\n";
print "z = ", length($3)/$z, "\n";
}
You can change this by making them * instead of +, or *? or
+?. Isn't it sick?
In reply to RE: RE: Primes
by japhy
in thread Primes
by Mo
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|