query: Finding the highest possible product from the make up of a number
positive_passages.docid: 22274
positive_passages.text: Partitioning a natural number $n$ in order to get the maximum product sequence of its addends
negative_passages.docid: 56808
negative_passages.text: Getting the lowest and highest value from integers without using arrays?
negative_passages.docid: 42750
negative_passages.text: Find the most occurring number in a List
negative_passages.docid: 81124
negative_passages.text: Infinite product problem: $\sum p_n0$
negative_passages.docid: 98423
negative_passages.text: How To Apply and Understand the Generating Function for Number Partitioning
negative_passages.docid: 71202
negative_passages.text: Finding the second highest number in array
negative_passages.docid: 36757
negative_passages.text: I can't determine the maximum natural number which is unable to be represented as $17\times x+23\times y$
negative_passages.docid: 86787
negative_passages.text: How to find the max number(s) in a list with tied numbers
negative_passages.docid: 67026
negative_passages.text: Best way to find all factors of a given number
negative_passages.docid: 153072
negative_passages.text: Guessing a subset of $\{1,...,N\}$
negative_passages.docid: 103733
negative_passages.text: Maximum product prefix string
negative_passages.docid: 35899
negative_passages.text: Simple logic problem: Finding largest and smallest number among 3 numbers
negative_passages.docid: 149010
negative_passages.text: Finding Combinations to the provided Sum value
negative_passages.docid: 27579
negative_passages.text: Evaluating the infinite product $ \prod\limits_{n=1}^{\infty} \cos(\frac{y}{2^n}) $
negative_passages.docid: 11359
negative_passages.text: Determine the Set of a Sum of Numbers
negative_passages.docid: 89512
negative_passages.text: Finding two numbers given their sum and their product
negative_passages.docid: 1539
negative_passages.text: How do you calculate the modulo of a high-raised number?