Next: Optimization Up: PIOLOGIE Manual An Exact Previous: Functions

Mathematical Constants `(pi.h)`

Algorithm:		`a := Pi(n)`
Input:		$n\in\texttt{size\_t}$ .
Output:		$a\in\textsf{Pi}$ such that $\vert a-\pi\cdot10^n\vert < 1\quad\Box$

Algorithm:		`o := o << a`
Input:		$o\in\texttt{ostream}, a\in\textsf{Pi}$ .
Output:		$o\in\texttt{ostream}\quad\Box$

Algorithm:		`a := Zeta3(n)`
Input:		$n\in\texttt{size\_t}$ .
Output:		$a\in\textsf{Zeta3}$ such that $\vert a-\zeta(3)\cdot10^n\vert < 1\quad\Box$

Algorithm:		`o := o << a`
Input:		$o\in\texttt{ostream}, a\in\textsf{Zeta3}$ .
Output:		$o\in\texttt{ostream}\quad\Box$

Piologie Version 1.2
3/3/1998

Mathematical Constants (pi.h)