FLINT3.7.0-dev
/

gr_generic_rising, gr_generic_rising_ui, gr_generic_falling, gr_generic_falling_ui

Synopsis#include <flint/gr_special.h>
int gr_generic_rising(gr_ptr res, gr_srcptr x, gr_srcptr y, gr_ctx_t ctx)source
int gr_generic_rising_ui(gr_ptr res, gr_srcptr x, ulong y, gr_ctx_t ctx)source
int gr_generic_falling(gr_ptr res, gr_srcptr x, gr_srcptr y, gr_ctx_t ctx)source
int gr_generic_falling_ui(gr_ptr res, gr_srcptr x, ulong y, gr_ctx_t ctx)source

Rising factorials by binary splitting of the product x (x+1) \cdots (x+n-1), with a basecase of 16 factors; falling factorials as rising factorials of x - n + 1. Non-integer y gives GR_UNABLE.

Cite this page

The FLINT team, “gr_generic_rising, gr_generic_rising_ui, gr_generic_falling, gr_generic_falling_ui (gr_special.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_special/gr_generic_rising.html (generated 2026-10-20).