In computer science, the subset sum problem is an important decision problem in complexity theory and cryptography. There are several equivalent formulations of the problem. One of them is: given a set (or multiset) of integers, is there a non-empty subset whose sum is zero? For example, given the set { − 7 , − 3 , − 2 , 5 , 8 } {\displaystyle \{-7,-3,-2,5,8\}} , the answer is yes because the subset { − 3 ...

The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items. The problem often arises in resource allocation where there are financial constraints and is studied in fields such as combinatorics, computer science...

This article gives some specific values of the Riemann zeta function, including values at integer arguments, and some series involving them. == The Riemann zeta function at 0 and 1 == At zero, one has ζ ( 0 ) = B 1 − = − B 1 + = − ...