FLINT3.7.0-dev
/

padic_radix_neg, padic_radix_add, padic_radix_sub, padic_radix_mul

Synopsis#include <flint/padic_radix.h>
int padic_radix_neg(padic_radix_t res, const padic_radix_t x, gr_ctx_t ctx)source
int padic_radix_add(padic_radix_t res, const padic_radix_t x, const padic_radix_t y, gr_ctx_t ctx)source
int padic_radix_sub(padic_radix_t res, const padic_radix_t x, const padic_radix_t y, gr_ctx_t ctx)source
int padic_radix_mul(padic_radix_t res, const padic_radix_t x, const padic_radix_t y, gr_ctx_t ctx)source

Set res to −x-x, x+yx + y, x−yx - y and xyxy. The error term of a sum is O(pmin⁡(Nx,Ny))O(p^{\min(N_x, N_y)}) and that of a product O(pmin⁡(Nx+vy,Ny+vx))O(p^{\min(N_x + v_y, N_y + v_x)}); the result is then truncated to the context precision. An exact zero factor gives an exact zero. An inexact zero O(pN)O(p^{N}) enters the error term of a product with valuation NN, so that for example O(pNx)⋅O(pNy)=O(pNx+Ny)O(p^{N_x}) \cdot O(p^{N_y}) = O(p^{N_x + N_y}).

Guides#

Cite this page

The FLINT team, “padic_radix_neg, padic_radix_add, padic_radix_sub, padic_radix_mul (padic_radix.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/padic_radix/padic_radix_neg.html (generated 2026-11-02).