{
  "index": "2018-B-1",
  "type": "COMB",
  "tag": [
    "COMB",
    "ALG"
  ],
  "difficulty": "",
  "question": "Let $\\mathcal{P}$ be the set of vectors defined by\n\\[\n\\mathcal{P} = \\left\\{ \\left. \\begin{pmatrix} a \\\\ b \\end{pmatrix} \\right| 0 \\leq a \\leq 2, 0 \\leq b \\leq 100, \\mbox{ and } a,b \\in \\mathbb{Z} \\right\\}.\n\\]\nFind all $\\mathbf{v} \\in \\mathcal{P}$ such that the set $\\mathcal{P} \\setminus \\{ \\mathbf{v} \\}$ obtained by omitting\nvector $\\mathbf{v}$ from $\\mathcal{P}$ can be partitioned into two sets of equal size and equal sum.",
  "solution": "The answer is the collection of vectors $(1,b)$ where $0 \\leq b \\leq 100$ and $b$ is even.\n (For ease of typography, we write tuples instead of column vectors.)\n\nFirst we show that if $\\mathcal{P} \\setminus \\{\\mathbf{v}\\}$ can be partitioned into subsets $S_1$ and $S_2$ of equal size and equal sum, then $\\mathbf{v}$ must be of the form $(1,b)$ where $b$ is even. For a finite nonempty set $S$ of vectors in $\\mathbb{Z}^2$, let $\\Sigma(S)$ denote the sum of the vectors in $S$. \nSince the average $x$- and $y$-coordinates in $\\mathcal{P}$ are $1$ and $50$, respectively, and there are $3\\cdot 101$ elements in $\\mathcal{P}$, we have\n\\[\n\\Sigma(P) = 303 \\cdot (1,50) = (303,15150). \n\\]\nOn the other hand, \n\\[\n\\Sigma(P) = \\mathbf{v}+\\Sigma(S_1)+\\Sigma(S_2) = \\mathbf{v}+2\\Sigma(S_1). \n\\]\nBy parity considerations, the entries of $\\mathbf{v}$ must be odd and even, respectively, and thus $\\mathbf{v}$ is of the claimed form.\n\nNext suppose $\\mathbf{v} = (1,b)$ where $b$ is even. Note that $\\mathcal{P} \\setminus \\{(1,50)\\}$ can be partitioned into $151$ pairs of (distinct) vectors $(x,y)$ and $(2-x,100-y)$, each summing to $(2,100)$. If $b \\neq 50$ then three of these pairs are $\\{(1,b),(1,100-b)\\}$,$\\{(2,b),(0,100-b)\\}$, and $\\{(2,25+b/2),(0,75-b/2)\\}$. Of the remaining $148$ pairs, assign half of them to $S_1$ and half to $S_2$, and then complete the partition of $\\mathcal{P} \\setminus \\{\\mathbf{v}\\}$ by assigning $(0,100-b)$, $(2,25+b/2)$, and $(1,50)$ to $S_1$ and $(1,100-b)$, $(2,b)$, and $(0,75-b/2)$ to $S_2$. (Note that the three vectors assigned to each of $S_1$ and $S_2$ have the same sum $(3,175-b/2)$.) By construction, $S_1$ and $S_2$ have the same number of elements, and $\\Sigma(S_1) = \\Sigma(S_2)$.\n\nFor $b=50$, this construction does not work because $(1,b) = (100-b)$, but a slight variation can be made.\n In this case, three of the pairs in $\\mathcal{P} \\setminus \\{(1,50)\\}$ are $\\{(2,50),(0,50)\\}$, $\\{(1,51),(1,49)\\}$, and $\\{(0,49),(2,51)\\}$. Assign half of the other $148$ pairs to $S_1$ and half to $S_2$, and complete the partition of\n$\\mathcal{P} \\setminus \\{(1,50)\\}$ by assigning $(2,50)$, $(1,51)$, and $(0,49)$ to $S_1$ and $(0,50)$, $(1,49)$, and $(2,51)$ to $S_2$.",
  "vars": [
    "a",
    "b",
    "x",
    "y",
    "P",
    "v",
    "S",
    "S_1",
    "S_2"
  ],
  "params": [
    "\\\\Sigma"
  ],
  "sci_consts": [],
  "variants": {
    "descriptive_long": {
      "map": {
        "a": "horizon",
        "b": "vertical",
        "x": "pairxco",
        "y": "pairyco",
        "P": "setvect",
        "v": "omitvec",
        "S": "vectorset",
        "S_1": "subsetone",
        "S_2": "subsettwo",
        "\\Sigma": "vectorsum"
      },
      "question": "Let $\\mathcal{setvect}$ be the set of vectors defined by\n\\[\n\\mathcal{setvect} = \\left\\{ \\left. \\begin{pmatrix} horizon \\\\ vertical \\end{pmatrix} \\right| 0 \\leq horizon \\leq 2, 0 \\leq vertical \\leq 100, \\mbox{ and } horizon,vertical \\in \\mathbb{Z} \\right\\}.\n\\]\nFind all $\\mathbf{omitvec} \\in \\mathcal{setvect}$ such that the set $\\mathcal{setvect} \\setminus \\{ \\mathbf{omitvec} \\}$ obtained by omitting\nvector $\\mathbf{omitvec}$ from $\\mathcal{setvect}$ can be partitioned into two sets of equal size and equal sum.",
      "solution": "The answer is the collection of vectors $(1,vertical)$ where $0 \\leq vertical \\leq 100$ and $vertical$ is even.\n (For ease of typography, we write tuples instead of column vectors.)\n\nFirst we show that if $\\mathcal{setvect} \\setminus \\{\\mathbf{omitvec}\\}$ can be partitioned into subsets subsetone and subsettwo of equal size and equal sum, then $\\mathbf{omitvec}$ must be of the form $(1,vertical)$ where $vertical$ is even. For a finite nonempty set $vectorset$ of vectors in $\\mathbb{Z}^2$, let $vectorsum(vectorset)$ denote the sum of the vectors in vectorset. \nSince the average $pairxco$- and $pairyco$-coordinates in $\\mathcal{setvect}$ are $1$ and $50$, respectively, and there are $3\\cdot 101$ elements in $\\mathcal{setvect}$, we have\n\\[\nvectorsum(setvect) = 303 \\cdot (1,50) = (303,15150).\n\\]\nOn the other hand, \n\\[\nvectorsum(setvect) = \\mathbf{omitvec}+vectorsum(subsetone)+vectorsum(subsettwo) = \\mathbf{omitvec}+2vectorsum(subsetone).\n\\]\nBy parity considerations, the entries of $\\mathbf{omitvec}$ must be odd and even, respectively, and thus $\\mathbf{omitvec}$ is of the claimed form.\n\nNext suppose $\\mathbf{omitvec} = (1,vertical)$ where $vertical$ is even. Note that $\\mathcal{setvect} \\setminus \\{(1,50)\\}$ can be partitioned into $151$ pairs of (distinct) vectors $(pairxco,pairyco)$ and $(2-pairxco,100-pairyco)$, each summing to $(2,100)$. If $vertical \\neq 50$ then three of these pairs are $\\{(1,vertical),(1,100-vertical)\\}$,$\\{(2,vertical),(0,100-vertical)\\}$, and $\\{(2,25+vertical/2),(0,75-vertical/2)\\}$. Of the remaining $148$ pairs, assign half of them to subsetone and half to subsettwo, and then complete the partition of $\\mathcal{setvect} \\setminus \\{\\mathbf{omitvec}\\}$ by assigning $(0,100-vertical)$, $(2,25+vertical/2)$, and $(1,50)$ to subsetone and $(1,100-vertical)$, $(2,vertical)$, and $(0,75-vertical/2)$ to subsettwo. (Note that the three vectors assigned to each of subsetone and subsettwo have the same sum $(3,175-vertical/2)$.) By construction, subsetone and subsettwo have the same number of elements, and $vectorsum(subsetone) = vectorsum(subsettwo)$.\n\nFor $vertical=50$, this construction does not work because $(1,vertical) = (100-vertical)$, but a slight variation can be made.\n In this case, three of the pairs in $\\mathcal{setvect} \\setminus \\{(1,50)\\}$ are $\\{(2,50),(0,50)\\}$, $\\{(1,51),(1,49)\\}$, and $\\{(0,49),(2,51)\\}$. Assign half of the other $148$ pairs to subsetone and half to subsettwo, and complete the partition of\n$\\mathcal{setvect} \\setminus \\{(1,50)\\}$ by assigning $(2,50)$, $(1,51)$, and $(0,49)$ to subsetone and $(0,50)$, $(1,49)$, and $(2,51)$ to subsettwo."
    },
    "descriptive_long_confusing": {
      "map": {
        "a": "toothpaste",
        "b": "shoelaces",
        "x": "chandelier",
        "y": "toothbrush",
        "P": "bookshelf",
        "v": "sandcastle",
        "S": "raincloud",
        "S_1": "raincloudone",
        "S_2": "raincloudtwo",
        "\\\\Sigma": "\\\\flamingo"
      },
      "question": "Let $\\mathcal{bookshelf}$ be the set of vectors defined by\n\\[\n\\mathcal{bookshelf} = \\left\\{ \\left. \\begin{pmatrix} toothpaste \\\\ shoelaces \\end{pmatrix} \\right| 0 \\leq toothpaste \\leq 2, 0 \\leq shoelaces \\leq 100, \\mbox{ and } toothpaste,shoelaces \\in \\mathbb{Z} \\right\\}.\n\\]\nFind all $\\mathbf{sandcastle} \\in \\mathcal{bookshelf}$ such that the set $\\mathcal{bookshelf} \\setminus \\{ \\mathbf{sandcastle} \\}$ obtained by omitting\nvector $\\mathbf{sandcastle}$ from $\\mathcal{bookshelf}$ can be partitioned into two sets of equal size and equal sum.",
      "solution": "The answer is the collection of vectors $(1,shoelaces)$ where $0 \\leq shoelaces \\leq 100$ and $shoelaces$ is even.\n (For ease of typography, we write tuples instead of column vectors.)\n\nFirst we show that if $\\mathcal{bookshelf} \\setminus \\{\\mathbf{sandcastle}\\}$ can be partitioned into subsets $raincloudone$ and $raincloudtwo$ of equal size and equal sum, then $\\mathbf{sandcastle}$ must be of the form $(1,shoelaces)$ where $shoelaces$ is even. For a finite nonempty set $raincloud$ of vectors in $\\mathbb{Z}^2$, let $\\flamingo(raincloud)$ denote the sum of the vectors in $raincloud$.\nSince the average chandelier- and toothbrush-coordinates in $\\mathcal{bookshelf}$ are $1$ and $50$, respectively, and there are $3\\cdot 101$ elements in $\\mathcal{bookshelf}$, we have\n\\[\n\\flamingo(bookshelf) = 303 \\cdot (1,50) = (303,15150).\n\\]\nOn the other hand,\n\\[\n\\flamingo(bookshelf) = \\mathbf{sandcastle}+\\flamingo(raincloudone)+\\flamingo(raincloudtwo) = \\mathbf{sandcastle}+2\\flamingo(raincloudone).\n\\]\nBy parity considerations, the entries of $\\mathbf{sandcastle}$ must be odd and even, respectively, and thus $\\mathbf{sandcastle}$ is of the claimed form.\n\nNext suppose $\\mathbf{sandcastle} = (1,shoelaces)$ where $shoelaces$ is even. Note that $\\mathcal{bookshelf} \\setminus \\{(1,50)\\}$ can be partitioned into $151$ pairs of (distinct) vectors $(chandelier,toothbrush)$ and $(2-chandelier,100-toothbrush)$, each summing to $(2,100)$. If $shoelaces \\neq 50$ then three of these pairs are $\\{(1,shoelaces),(1,100-shoelaces)\\}$, $\\{(2,shoelaces),(0,100-shoelaces)\\}$, and $\\{(2,25+shoelaces/2),(0,75-shoelaces/2)\\}$. Of the remaining $148$ pairs, assign half of them to $raincloudone$ and half to $raincloudtwo$, and then complete the partition of $\\mathcal{bookshelf} \\setminus \\{\\mathbf{sandcastle}\\}$ by assigning $(0,100-shoelaces)$, $(2,25+shoelaces/2)$, and $(1,50)$ to $raincloudone$ and $(1,100-shoelaces)$, $(2,shoelaces)$, and $(0,75-shoelaces/2)$ to $raincloudtwo$. (Note that the three vectors assigned to each of $raincloudone$ and $raincloudtwo$ have the same sum $(3,175-shoelaces/2)$.) By construction, $raincloudone$ and $raincloudtwo$ have the same number of elements, and $\\flamingo(raincloudone) = \\flamingo(raincloudtwo)$.\n\nFor $shoelaces=50$, this construction does not work because $(1,shoelaces) = (100-shoelaces)$, but a slight variation can be made.\nIn this case, three of the pairs in $\\mathcal{bookshelf} \\setminus \\{(1,50)\\}$ are $\\{(2,50),(0,50)\\}$, $\\{(1,51),(1,49)\\}$, and $\\{(0,49),(2,51)\\}$. Assign half of the other $148$ pairs to $raincloudone$ and half to $raincloudtwo$, and complete the partition of $\\mathcal{bookshelf} \\setminus \\{(1,50)\\}$ by assigning $(2,50)$, $(1,51)$, and $(0,49)$ to $raincloudone$ and $(0,50)$, $(1,49)$, and $(2,51)$ to $raincloudtwo$.",
      "commentary": ""
    },
    "descriptive_long_misleading": {
      "map": {
        "a": "gargantuannum",
        "b": "negligibleval",
        "x": "immutableaxis",
        "y": "shallowdepth",
        "P": "voidcollection",
        "v": "singularscalar",
        "S": "solelement",
        "S_1": "totalityalpha",
        "S_2": "totalitybeta",
        "\\Sigma": "difference"
      },
      "question": "Let $\\mathcal{voidcollection}$ be the set of vectors defined by\n\\[\n\\mathcal{voidcollection} = \\left\\{ \\left. \\begin{pmatrix} gargantuannum \\\\ negligibleval \\end{pmatrix} \\right| 0 \\leq gargantuannum \\leq 2, 0 \\leq negligibleval \\leq 100, \\mbox{ and } gargantuannum,negligibleval \\in \\mathbb{Z} \\right\\}.\n\\]\nFind all $\\mathbf{singularscalar} \\in \\mathcal{voidcollection}$ such that the set $\\mathcal{voidcollection} \\setminus \\{ \\mathbf{singularscalar} \\}$ obtained by omitting\nvector $\\mathbf{singularscalar}$ from $\\mathcal{voidcollection}$ can be partitioned into two sets of equal size and equal sum.",
      "solution": "The answer is the collection of vectors $(1,negligibleval)$ where $0 \\leq negligibleval \\leq 100$ and negligibleval is even.\n (For ease of typography, we write tuples instead of column vectors.)\n\nFirst we show that if $\\mathcal{voidcollection} \\setminus \\{\\mathbf{singularscalar}\\}$ can be partitioned into subsets totalityalpha and totalitybeta of equal size and equal sum, then $\\mathbf{singularscalar}$ must be of the form $(1,negligibleval)$ where negligibleval is even. For a finite nonempty set solelement of vectors in $\\mathbb{Z}^2$, let difference(solelement) denote the sum of the vectors in solelement. \nSince the average immutableaxis- and shallowdepth-coordinates in $\\mathcal{voidcollection}$ are $1$ and $50$, respectively, and there are $3\\cdot 101$ elements in $\\mathcal{voidcollection}$, we have\n\\[\ndifference(voidcollection) = 303 \\cdot (1,50) = (303,15150). \n\\]\nOn the other hand, \n\\[\ndifference(voidcollection) = \\mathbf{singularscalar}+difference(totalityalpha)+difference(totalitybeta) = \\mathbf{singularscalar}+2difference(totalityalpha). \n\\]\nBy parity considerations, the entries of $\\mathbf{singularscalar}$ must be odd and even, respectively, and thus $\\mathbf{singularscalar}$ is of the claimed form.\n\nNext suppose $\\mathbf{singularscalar} = (1,negligibleval)$ where negligibleval is even. Note that $\\mathcal{voidcollection} \\setminus \\{(1,50)\\}$ can be partitioned into $151$ pairs of (distinct) vectors $(immutableaxis,shallowdepth)$ and $(2-immutableaxis,100-shallowdepth)$, each summing to $(2,100)$. If negligibleval $\\neq 50$ then three of these pairs are $\\{(1,negligibleval),(1,100-negligibleval)\\}$,$\\{(2,negligibleval),(0,100-negligibleval)\\}$, and $\\{(2,25+negligibleval/2),(0,75-negligibleval/2)\\}$. Of the remaining $148$ pairs, assign half of them to totalityalpha and half to totalitybeta, and then complete the partition of $\\mathcal{voidcollection} \\setminus \\{\\mathbf{singularscalar}\\}$ by assigning $(0,100-negligibleval)$, $(2,25+negligibleval/2)$, and $(1,50)$ to totalityalpha and $(1,100-negligibleval)$, $(2,negligibleval)$, and $(0,75-negligibleval/2)$ to totalitybeta. (Note that the three vectors assigned to each of totalityalpha and totalitybeta have the same sum $(3,175-negligibleval/2)$.) By construction, totalityalpha and totalitybeta have the same number of elements, and difference(totalityalpha) = difference(totalitybeta).\n\nFor negligibleval=50, this construction does not work because $(1,negligibleval) = (100-negligibleval)$, but a slight variation can be made.\n In this case, three of the pairs in $\\mathcal{voidcollection} \\setminus \\{(1,50)\\}$ are $\\{(2,50),(0,50)\\}$, $\\{(1,51),(1,49)\\}$, and $\\{(0,49),(2,51)\\}$. Assign half of the other $148$ pairs to totalityalpha and half to totalitybeta, and complete the partition of\n$\\mathcal{voidcollection} \\setminus \\{(1,50)\\}$ by assigning $(2,50)$, $(1,51)$, and $(0,49)$ to totalityalpha and $(0,50)$, $(1,49)$, and $(2,51)$ to totalitybeta."
    },
    "garbled_string": {
      "map": {
        "a": "qzxwvtnp",
        "b": "hjgrksla",
        "x": "jcnvlspy",
        "y": "rdmqhule",
        "P": "vbxthqer",
        "v": "zmplrgao",
        "S": "tknwusje",
        "S_1": "pqsldmza",
        "S_2": "brtwexli",
        "\\Sigma": "lqfzopmn"
      },
      "question": "Let $\\mathcal{vbxthqer}$ be the set of vectors defined by\n\\[\n\\mathcal{vbxthqer} = \\left\\{ \\left. \\begin{pmatrix} qzxwvtnp \\\\ hjgrksla \\end{pmatrix} \\right| 0 \\leq qzxwvtnp \\leq 2, 0 \\leq hjgrksla \\leq 100, \\mbox{ and } qzxwvtnp,hjgrksla \\in \\mathbb{Z} \\right\\}.\n\\]\nFind all $\\mathbf{zmplrgao} \\in \\mathcal{vbxthqer}$ such that the set $\\mathcal{vbxthqer} \\setminus \\{ \\mathbf{zmplrgao} \\}$ obtained by omitting\nvector $\\mathbf{zmplrgao}$ from $\\mathcal{vbxthqer}$ can be partitioned into two sets of equal size and equal sum.",
      "solution": "The answer is the collection of vectors $(1,hjgrksla)$ where $0 \\leq hjgrksla \\leq 100$ and $hjgrksla$ is even.\n (For ease of typography, we write tuples instead of column vectors.)\n\nFirst we show that if $\\mathcal{vbxthqer} \\setminus \\{\\mathbf{zmplrgao}\\}$ can be partitioned into subsets $pqsldmza$ and $brtwexli$ of equal size and equal sum, then $\\mathbf{zmplrgao}$ must be of the form $(1,hjgrksla)$ where $hjgrksla$ is even. For a finite nonempty set $tknwusje$ of vectors in $\\mathbb{Z}^2$, let $lqfzopmn(tknwusje)$ denote the sum of the vectors in $tknwusje$.\nSince the average $jcnvlspy$- and $rdmqhule$-coordinates in $\\mathcal{vbxthqer}$ are $1$ and $50$, respectively, and there are $3\\cdot 101$ elements in $\\mathcal{vbxthqer}$, we have\n\\[\nlqfzopmn(vbxthqer) = 303 \\cdot (1,50) = (303,15150).\n\\]\nOn the other hand,\n\\[\nlqfzopmn(vbxthqer) = \\mathbf{zmplrgao}+lqfzopmn(pqsldmza)+lqfzopmn(brtwexli) = \\mathbf{zmplrgao}+2lqfzopmn(pqsldmza).\n\\]\nBy parity considerations, the entries of $\\mathbf{zmplrgao}$ must be odd and even, respectively, and thus $\\mathbf{zmplrgao}$ is of the claimed form.\n\nNext suppose $\\mathbf{zmplrgao} = (1,hjgrksla)$ where $hjgrksla$ is even. Note that $\\mathcal{vbxthqer} \\setminus \\{(1,50)\\}$ can be partitioned into $151$ pairs of (distinct) vectors $(jcnvlspy,rdmqhule)$ and $(2-jcnvlspy,100-rdmqhule)$, each summing to $(2,100)$. If $hjgrksla \\neq 50$ then three of these pairs are $\\{(1,hjgrksla),(1,100-hjgrksla)\\}$,$\\{(2,hjgrksla),(0,100-hjgrksla)\\}$, and $\\{(2,25+hjgrksla/2),(0,75-hjgrksla/2)\\}$. Of the remaining $148$ pairs, assign half of them to $pqsldmza$ and half to $brtwexli$, and then complete the partition of $\\mathcal{vbxthqer} \\setminus \\{\\mathbf{zmplrgao}\\}$ by assigning $(0,100-hjgrksla)$, $(2,25+hjgrksla/2)$, and $(1,50)$ to $pqsldmza$ and $(1,100-hjgrksla)$, $(2,hjgrksla)$, and $(0,75-hjgrksla/2)$ to $brtwexli$. (Note that the three vectors assigned to each of $pqsldmza$ and $brtwexli$ have the same sum $(3,175-hjgrksla/2)$.) By construction, $pqsldmza$ and $brtwexli$ have the same number of elements, and $lqfzopmn(pqsldmza) = lqfzopmn(brtwexli)$.\n\nFor $hjgrksla=50$, this construction does not work because $(1,hjgrksla) = (100-hjgrksla)$, but a slight variation can be made.\n In this case, three of the pairs in $\\mathcal{vbxthqer} \\setminus \\{(1,50)\\}$ are $\\{(2,50),(0,50)\\}$, $\\{(1,51),(1,49)\\}$, and $\\{(0,49),(2,51)\\}$. Assign half of the other $148$ pairs to $pqsldmza$ and half to $brtwexli$, and complete the partition of\n$\\mathcal{vbxthqer} \\setminus \\{(1,50)\\}$ by assigning $(2,50)$, $(1,51)$, and $(0,49)$ to $pqsldmza$ and $(0,50)$, $(1,49)$, and $(2,51)$ to $brtwexli$. "
    },
    "kernel_variant": {
      "question": "Let\n\n    \\[\\mathcal P = \\bigl\\{(a,b)^{\\mathrm T}\\in\\mathbb Z^2 \\;\\bigm|\\; 0\\le a\\le 6,\\; 0\\le b\\le 120\\bigr\\}\\]\n\n(the 847 integer lattice points in the rectangle\n$0\\le a\\le 6,\\;0\\le b\\le120$).\n\nFor which vectors $\\mathbf v\\in\\mathcal P$ does there exist a partition\n\n\\[\\mathcal P\\setminus\\{\\mathbf v\\}=S_1\\sqcup S_2,\\qquad |S_1|=|S_2|,\\qquad \\Sigma(S_1)=\\Sigma(S_2),\\]\n\nwhere, for a finite set $T\\subset\\mathbb Z^2$, the symbol\n$\\displaystyle\\Sigma(T)=\\sum_{\\mathbf x\\in T}\\!\\mathbf x$ denotes the\ncoordinate–wise sum of the elements of $T$?",
      "solution": "Throughout write |T| for the cardinality of a finite set T and identify column vectors with ordered pairs.  For a finite set T put\n    \\[\\Sigma(T)=(\\Sigma_x(T),\\Sigma_y(T)).\\]\n\n1.  The total sum of the rectangle\n-----------------------------------\nBecause\n    \\[\\sum_{a=0}^{6}a = 21,\\quad \\sum_{b=0}^{120}b = 7260,\\]\nwe obtain for the whole rectangle\n    \\[\\Sigma(\\mathcal P)=(21\\cdot121,\\,7\\cdot7260)=(2541,50\\,820).\\]\n\n2.  A first parity condition\n----------------------------\nIf $\\mathbf v=(a,b)$ is removed and $\\mathcal P\\setminus\\{\\mathbf v\\}=S_1\\sqcup S_2$ with $|S_1|=|S_2|$ and $\\Sigma(S_1)=\\Sigma(S_2)$, then\n\\[2\\,\\Sigma(S_1)=\\Sigma(\\mathcal P)-\\mathbf v.\\]\nReducing the two coordinates modulo 2 gives\n\\[(a,b)\\equiv(1,0)\\pmod 2.\\]\nThus $a$ must be odd and $b$ even; only the columns $a=1,3,5$ are still possible.\n\n3.  The involution \\(\\iota\\) and the multiset of differences\n-------------------------------------------------------------\nDefine the involution\n\\[\\iota:(x,y)\\longmapsto(6-x,120-y).\\]\nIts unique fixed point is $\\mathbf c=(3,60)$.  Each of the remaining $423$ points lies in an unordered pair $\\{P,\\iota(P)\\}$.  Fix once and for all an orientation of every such pair and write\n\\[d(P):=P-\\iota(P).\\]\nIf $P=(x,y)$ one has\n\\[d(P)=(2x-6,\\,2y-120).\\]\nWe distinguish\n•  363 row differences coming from $x\\neq3$ (\"row\"),\n•  60 central differences coming from $x=3$ (\"central\"),\n•  the fixed point $\\mathbf c$.\n\nThe first coordinate of every row difference is $\\pm2,\\pm4$ or $\\pm6$, while every central difference has first coordinate 0.\n\n4.  An obstruction for the columns $a=1$ and $a=5$\n---------------------------------------------------\nAmong the 363 row differences, the absolute first coordinates 2,4,6 occur exactly 121 times each.  Call\n\\[s_2,s_4,s_6\\in\\mathbb Z\\]\nthe (signed) excess of positive over negative occurrences inside the three classes.  Each $s_k$ is odd, so the $x$-contribution of the row differences equals\n\\[X_{\\text{row}}=2s_2+4s_4+6s_6\\equiv2+0+2\\equiv0\\pmod4.\\]\n\nIn the generic situation $\\mathbf v\\ne\\mathbf c$ the special difference\n\\[d_{\\mathrm{sp}}:=\\iota(\\mathbf v)-\\mathbf c=(3-a,60-b)\\]\ncontributes $3-a\\in\\{2,0,-2\\}$ to the first coordinate of the total.  When $a=1$ or $a=5$ one would need $X_{\\text{row}}=\\pm2$, contradicting the congruence above.  Hence no partition exists for $a=1$ or $5$.\n\nSo a \\emph{necessary} condition is\n\\[a=3 \\quad\\text{and}\\quad b\\text{ even}.\\]\nIt remains to prove sufficiency.\n\n5.  Row differences produce every multiple of 4\n----------------------------------------------\nFix a level $y\\in\\{0,1,\\dots,120\\}$ and abbreviate\n\\[s_y:=2y-120=2(y-60)\\in\\{-120,-118,\\dots,120\\}.\\]\nAt this level there are exactly the three row differences\n\\[( 2, s_y),\\; ( 4, s_y),\\; (6, s_y)\\]\nand their negatives.  Choose the signs $(+,+,-)$ or $(-,-,+)$.  In either choice the three $x$–coordinates sum to $0$, while the $y$–coordinates contribute $\\pm s_y$.\n\nDoing this independently for all 121 levels gives\n\\[\n \\sum_{\\text{row}} \\varepsilon_y s_y =:Y_{\\text{row}}.\n\\]\nBecause each $s_y$ is even and exactly 60 of them satisfy $s_y\\equiv2\\pmod4$, the parity argument of the review shows that $Y_{\\text{row}}$ is always a multiple of $4$; conversely the numbers $\\{s_y/2\\}_{y=0}^{120}$ are precisely the integers $-60,\\dots,60$, so by the standard \"balanced–sign\" lemma one can realise \n\\[Y_{\\text{row}}\\in\\{ -3660,-3656,\\dots,3660\\}\\quad(\\text{all multiples of }4).\\]\nIn particular, for every integer $k$ with $|k|\\le915$ one can obtain $Y_{\\text{row}}=4k$.\n\n6.  Central differences allow a correction by $0$ or $\\pm2$\n------------------------------------------------------------\nFor $y=0,\\dots,59$ the corresponding central difference equals\n\\[(0,2y-120)=(0,2\\,(y-60)).\\]\nHalf of these numbers are $\\equiv0\\pmod4$, the other half $\\equiv2\\pmod4$.  Choosing the orientation of a single central pair with $|2y-120|=2$ (for instance $y=59$) gives a contribution $\\pm2$ to the $y$–coordinate, while changing the orientations of further pairs whose $y$–value is a multiple of $4$ does not affect the residue class modulo $4$.  Hence, with the central differences one can achieve any even correction $Y_{\\text{cent}}$ satisfying\n\\[Y_{\\text{cent}}\\equiv Y_{\\text{row}} \\pmod4,\\qquad |Y_{\\text{cent}}|\\le120.\\]\n\n7.  Construction of the required partition\n------------------------------------------\nGeneric case $\\mathbf v=(3,b)$ with $b\\not=60$ even.  The special difference is $d_{\\mathrm{sp}}=(0,60-b)$, so equation (1b) of Section 3 is\n\\[d_{\\mathrm{sp}}+ \\sum_{\\text{row}} \\varepsilon_i d_i + \\sum_{\\text{cent}} \\delta_j c_j = \\mathbf0.\n\\]\nIts second coordinate demands\n\\[Y_{\\text{row}}+Y_{\\text{cent}} = b-60.\\]\nBecause $|b-60|\\le60$, pick a multiple of $4$, say $Y_{\\text{row}}$, with $|Y_{\\text{row}}|\\le60$ and $|Y_{\\text{row}}-(b-60)|\\le2$ (possible since consecutive multiples of $4$ differ by $4$).  Realise that $Y_{\\text{row}}$ with the row differences as described in Section 5.  Finally orient central differences so that their sum equals $Y_{\\text{cent}}:=b-60-Y_{\\text{row}}\\in\\{0,\\pm2\\}$; this is feasible by the previous paragraph.  Altogether both coordinates of the total difference vanish, so equation (1b) – and therefore the desired partition – is satisfied.\n\nCentral case $\\mathbf v=\\mathbf c=(3,60)$.  Here equation (1a) is to be solved.  Choose the row–signs so that $Y_{\\text{row}}=0$ (possible by Section 5) and orient the 60 central differences in 30 cancelling pairs.  Then both coordinates of the sum are 0, giving the required partition.\n\n8.  Conclusion\n--------------\nThe obstruction of Section 4 and the construction of Sections 5–7 together give the complete answer.\n\nboxed:  A partition with the stated properties exists exactly for the 61 vectors\n        \\[\\mathbf v=(3,b)\\quad(0\\le b\\le120,\\; b\\text{ even}).\\]\n\nFor every such vector an explicit partition is produced by the sign–choosing procedure described above.",
      "_meta": {
        "core_steps": [
          "Compute |P| and its total sum Σ(P) from coordinate averages.",
          "Apply Σ(P)=v+2Σ(S₁) to force parity constraints on v (odd x-coord, even y-coord).",
          "Use the involution (x,y)↦(max_a−x, max_b−y) to pair remaining vectors so each pair sums to the constant vector (max_a, max_b).",
          "After deleting v, redistribute three specially chosen pairs to balance both size and sum of the two parts; tweak this when v is the unique fixed point of the involution."
        ],
        "mutable_slots": {
          "slot1": {
            "description": "Upper bound of the first coordinate (so a∈[0,max_a]).  Must be even so that Σ(P) has odd x-parity and the involution has at most one fixed x-value.",
            "original": 2
          },
          "slot2": {
            "description": "Upper bound of the second coordinate (so b∈[0,max_b]).  Must be even so that Σ(P) has even y-parity and the involution may have one fixed y-value.",
            "original": 100
          },
          "slot3": {
            "description": "Constant vector produced by the involution pairing; equals (max_a , max_b).",
            "original": "(2,100)"
          },
          "slot4": {
            "description": "Midpoint in the y-direction, i.e. max_b/2, which yields the possible fixed point (1, midpoint_y).",
            "original": 50
          },
          "slot5": {
            "description": "Total number of vectors |P| = (max_a+1)(max_b+1); determines parity of Σ(P).",
            "original": 303
          }
        }
      }
    }
  },
  "checked": true,
  "problem_type": "calculation",
  "iteratively_fixed": true
}