Pell's equation

From Rosetta Code
Revision as of 21:54, 2 February 2019 by Trizen (talk | contribs) (→‎{{header|Sidef}}: fix typo)
Pell's equation is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.

Pell's equation is a Diophantine equation of the form

x2 - ny2 = 1

with integer solutions for x and y, where n is a given nonsquare positive integer.

Task requirements
  •   find the smallest solution in positive integers to Pell's equation for n = {61, 109, 181, 277}.
See also

Perl

<lang perl>sub solve_pell {

   my ($n) = @_;
   use bigint try => 'GMP';
   my $x = int(sqrt($n));
   my $y = $x;
   my $z = 1;
   my $r = 2 * $x;
   my ($e1, $e2) = (1, 0);
   my ($f1, $f2) = (0, 1);
   for (; ;) {
       $y = $r * $z - $y;
       $z = int(($n - $y * $y) / $z);
       $r = int(($x + $y) / $z);
       ($e1, $e2) = ($e2, $r * $e2 + $e1);
       ($f1, $f2) = ($f2, $r * $f2 + $f1);
       my $A = $e2 + $x * $f2;
       my $B = $f2;
       if ($A**2 - $n * $B**2 == 1) {
           return ($A, $B);
       }
   }

}

foreach my $n (61, 109, 181, 277) {

   my ($x, $y) = solve_pell($n);
   printf("x^2 - %3d*y^2 = 1 for x = %-21s and y = %s\n", $n, $x, $y);

}</lang>

Output:
x^2 -  61*y^2 = 1 for x = 1766319049            and y = 226153980
x^2 - 109*y^2 = 1 for x = 158070671986249       and y = 15140424455100
x^2 - 181*y^2 = 1 for x = 2469645423824185801   and y = 183567298683461940
x^2 - 277*y^2 = 1 for x = 159150073798980475849 and y = 9562401173878027020

Sidef

<lang ruby>func solve_pell(n) {

   var x = n.isqrt
   var y = x
   var z = 1
   var r = 2*x
   var (e1, e2) = (1, 0)
   var (f1, f2) = (0, 1)
   loop {
       y = (r*z - y)
       z = floor((n - y*y) / z)
       r = floor((x + y) / z)
       (e1, e2) = (e2, r*e2 + e1)
       (f1, f2) = (f2, r*f2 + f1)
       var A = (e2 + x*f2)
       var B = f2
       if (A**2 - n*B**2 == 1) {
           return (A, B)
       }
   }

}

for n in [61, 109, 181, 277] {

   var (x, y) = solve_pell(n)
   printf("x^2 - %3d*y^2 = 1 for x = %-21s and y = %s\n", n, x, y)

}</lang>

Output:
x^2 -  61*y^2 = 1 for x = 1766319049            and y = 226153980
x^2 - 109*y^2 = 1 for x = 158070671986249       and y = 15140424455100
x^2 - 181*y^2 = 1 for x = 2469645423824185801   and y = 183567298683461940
x^2 - 277*y^2 = 1 for x = 159150073798980475849 and y = 9562401173878027020