Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On an algorithm that generates an interesting maximal set P(n) of the
  naturals for any n greater than or equal to 2   The paper considers the problem of finding the largest possible set P(n), a
subset of the set N of the natural numbers, with the property that a number is
in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none
in P(n). Here largest is in the set theoretic sense and n is greater than or
equal to 2. We call P(n) a maximal set obeying this property. For small n say 2
or 3, it is possible to develop P(n) intuitively but we strongly felt the
necessity of an algorithm for any n greater than or equal to 2. Now P(n) shall
invariably be a infinite set so we define another set Q(n) such that
Q(n)=N-P(n), prove that Q(n) is finite and, since P(n) is automatically known
if Q(n) is known, design an algorithm of worst case O(1) complexity which
generates Q(n).

32
The categories of this paper are: atom-ph
14
The categories of this paper are: math-ph
3
The categories of this paper are: physics
27
The categories of this paper are: comp-gas
23
The categories of this paper are: solv-int
19
The categories of this paper are: eess
16
The categories of this paper are: stat
30
The categories of this paper are: q-alg
37
The categories of this paper are: supr-con
8
The categories of this paper are: hep-ex
26
The categories of this paper are: bayes-an
10
The categories of this paper are: q-bio
33
The categories of this paper are: plasm-ph
25
The categories of this paper are: patt-sol
17
The categories of this paper are: q-fin
2
The categories of this paper are: math