PrimeSum, PrimeProduct, DivisorSum, DivisorProduct
Synopsis
#include <flint/fexpr_builtin.h>PrimeSumPrimeProductDivisorSumDivisorProductSums and products over primes and divisors: PrimeSum(f(p), For(p)) (\sum_{p} f(p)), PrimeProduct(f(p), For(p)) (\prod_{p} f(p)), DivisorSum(f(d), For(d, n)) (\sum_{d \mid n} f(d)) and DivisorProduct(f(d), For(d, n)) (\prod_{d \mid n} f(d)); a filter predicate may follow.
Cite this page
The FLINT team, “PrimeSum, PrimeProduct, DivisorSum, DivisorProduct (fexpr_builtin.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fexpr_builtin/PrimeSum.html (generated 2026-10-20).
@misc{flint-doc-fexpr-builtin-PrimeSum,
author = {{The FLINT team}},
title = {{PrimeSum, PrimeProduct, DivisorSum, DivisorProduct (fexpr\_builtin.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fexpr_builtin/PrimeSum.html},
note = {Generated 2026-10-20}
}