P-Adic numbers, basic: Difference between revisions

 

=={{header|FreeBASIC}}==

' ***********************************************

'subject: convert two rationals to p-adic numbers,

 

system

{{out|Examples}}

<pre>

=={{header|Go}}==

{{trans|FreeBASIC}}

 

import "fmt"

fmt.Println()

}

 

{{out}}

p-Adic arithmetics and conversion between rationals is implemented as instances of <code>Eq</code>, <code>Num</code>, <code>Fractional</code> and <code>Real</code> classes, so, they could be treated as usual real numbers (up to existence of some rationals for non-prime bases).

 

module Padic where

 

let m = (x*r) `mod` p

_:zs = subMod p (x:xs) (mulMod p [m] (b:bs))

 

Convertation between rationals and p-adic numbers

Uses the Nemo abstract algebra library. The Nemo library's rational reconstruction function gives up quite easily,

so another alternative to FreeBasic's crat() using vector products is below.

 

set_printing_mode(FlintPadicField, :terse)

println(a, "\n", dstring(a), "\n", b, "\n", dstring(b), "\n+ =\n", c, "\n", dstring(c), " $r\n")

end

<pre>

2 + O(2^5)

{{trans|Go}}

Translation of Go with some modifications, especially using exceptions when an error is encountered.

 

const

echo ""

except PadicError:

 

{{out}}

=={{header|Phix}}==

{{libheader|Phix/Class}}

constant EMX = 64 // exponent maximum (if indexing starts at -EMX)

constant DMX = 1e5 // approximation loop maximum

end if

printf(1,"\n")

{{out}}

<pre>

 

=={{header|Raku}}==

 

#!/usr/bin/env raku

}

}

{{out}}

<pre>

{{trans|FreeBASIC}}

{{libheader|Wren-dynamic}}

 

// constants

}

System.print()

 

{{out}}