Determine for which positive integers
![k](/media/m/f/1/3/f135be660b73381aa6bec048f0f79afc.png)
the set
![X = \{1990, 1990 + 1, 1990 + 2, \ldots, 1990 + k\}](/media/m/f/8/7/f8763e60102b91e1b11301e368c35000.png)
can be partitioned into two disjoint subsets
![A](/media/m/5/a/e/5ae81275ee67d638485e903bdc0e9cde.png)
and
![B](/media/m/c/e/e/ceebc05be717fa6aab8e71b02fe3e4e3.png)
such that the sum of the elements of
![A](/media/m/5/a/e/5ae81275ee67d638485e903bdc0e9cde.png)
is equal to the sum of the elements of
%V0
Determine for which positive integers $k$ the set $$X = \{1990, 1990 + 1, 1990 + 2, \ldots, 1990 + k\}$$ can be partitioned into two disjoint subsets $A$ and $B$ such that the sum of the elements of $A$ is equal to the sum of the elements of $B.$