# Constant-Sum Partitions of Even Cardinality

No Thumbnail Available

## View/Download File

## Persistent link to this item

##### Statistics

View Statistics## Journal Title

## Journal ISSN

## Volume Title

## Title

Constant-Sum Partitions of Even Cardinality

## Authors

## Published Date

2020

## Publisher

## Type

Scholarly Text or Essay

## Abstract

A number n is said to have the constant-sum property if for every possible partition of n, there exists disjoint subsets of the first n integers, such that the sum of the elements in each subset have the same remainder when divided by n (This means they are congruent with some constant integer c modulo n).
For the case when n is odd, Kaplan, Lev, and Roditty [1] proved in 2009 that there exists a constant-sum partition for n if and only if only there exists no more than one singleton set. For the case when n is even and split into an odd number of subsets, Freyberg [2] proved in 2019 that an n/2-sum partition exists for n if and only if there exists no more than one singleton subset.
This leaves open the case when n is even and each subset has an even number of elements. My UROP project focused on the case when n is even and broken into groups that each have even cardinality, that is, they each have an even number of elements.

## Description

Mathematics, Swenson College of Science and Engineering

## Related to

## Replaces

## License

## Series/Report Number

## Funding information

University of Minnesota's Undergraduate Research Opportunities Program

## Isbn identifier

## Doi identifier

## Previously Published Citation

## Other identifiers

## Suggested citation

Montgomery, Grant A. (2020). Constant-Sum Partitions of Even Cardinality. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/213284.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.