It seems clear that posters in
"agreement" with the troll-bot
are pretty much just sock-puppets
of same, i.e., 7777 is J.G., then
that it is pretty much just another
delegitimization attempt of the medium.
You present an example problem, then
suggest computing a solution. The
mathematics then isn't just the
computation, it's the arrival at
a solution. The corresponding solution
has intermediate developments that are
parameterizable and reusable for similar
problems, that's the mathematics. Here
it's for "find subsets of an n-set such that
for each 1 <= k <= N there exists i, j
s.t. i + j = k", then "find the smallest
such subset". Properties of laws of
arithmetic have that the odd numbers
plus zero are so a set. A Goldbach conjecture
would have it that the even numbers are
sums of (exactly two) primes, then for
figuring out where between log N[+] and 0.5 N
there are enough for also the odd numbers,
then for what those are, and otherwise as
of what additive partitions of size two,
among additive partitions, there would be
enough. Where Goldbach's prime conjecture
is so, then the primes and successors of
primes should suffice, on the order of log N
many, but that's an external fact and also
a conjecture.
[+] or pi(N)/N, see
https://en.wikipedia.org/wiki/Prime-counting_function
The count of additive partitions (of a non-
negative integer) grows rapidly, but the
number of additive 2-partitions doesn't so
necessarily, as between zero and N they are
exhausted or on the order of N/2 many. (This
is similar to some other examples of the "curse
of dimensions" or real difference between 2-many
and 3- or more-many, including in radix representation
where otherwise people don't see a difference as
about binary versus decimal or Ramsey numbers and
the completeness or computability of the 2-many
but not the more-many, or solving 2-body versus
3-body problems et cetera.) That said, the
mathematics includes not just arriving at laser-
like precision to a reduced problem tractable to
linear means, but then boxing out furthermore
what solutions there are under re-parameterizations
of the problem.
Then, the smallest such subset is some intersection
of the additive 2-partitions about that being of
among the N^2/2 many instead of the partition-count
summed over N many.
https://en.wikipedia.org/wiki/Partition_(number_theory)
Having reduced the problem, or defined it sufficiently
and referred to related concerns as establish its
means, then there are mathematics about it.
Now, about the troll-bot and sock-puppet coterie's
refusal to refine definition and putting the cart
before the horse and so on, first you put the horse
before the cart, then imagine it might so proceed.
Don't go beating the horse because it's hitched wrongly.
Then, we observe your jousting with the windmills, but,
keep in mind that's just a troll-bot's blustery windmill,
not the giant that as mathematicians we would want to
either grow to, climb to, or supplant altogether.
Chasing the phantoms of truth or verity is Quixotic
in a sense, then that disambiguating the phantasmal
and really getting to the true is the mathematically
valorous (as it begins as the Quixotic).
Then really if you want to solve the subset sum problem,
why don't you just give your research grant to somebody
else and have them solve it for you. Now you can excuse
me if that's rather barbed but you can keep breaking down
the problems to build them back up, then about that you
should find that there is the extra- and super-classical
(and not the non-classical except as so follows in the
extra). The very means or tractability are involved as
concrete numerical resources then about how simple careful
organization suffices to begin and proceed about then the
resulting richer organization of the entirety and about
otherwise the exhaustion of such simple means and then about
how the deductive inference about these limits and the
surpassing them then so follows again with simple careful
organization so as to begin, proceed, and finish.