Maximal product of primes whose sum is bounded
Number Theory
2012-07-04 v1
Abstract
If n is a positive integer, let h(n) denote the maximal value of the product of distinct primes whose sum does not exceed n. We give some properties of this function h and describe an algorithm able to compute h(n) for large values of n.
Cite
@article{arxiv.1207.0603,
title = {Maximal product of primes whose sum is bounded},
author = {Marc Deléglise and Jean-Louis Nicolas},
journal= {arXiv preprint arXiv:1207.0603},
year = {2012}
}