Distinct Lengths Modular Zero-sum Subsequences: A Proof of Graham's Conjecture

Details Distinct Lengths Modular Zero-sum Subsequences: A Proof of Graham's Conjecture Distinct Lengths Modular Zero-sum Subsequences: A Proof of Graham's Conjecture

2009-02-27

arxiv.org/abs/0902.4758v1

Mathematics

Number Theory

Scientific paper

Let $n$ be a positive integer and let $S$ be a sequence of $n$ integers in the interval $[0,n-1]$. If there is an $r$ such that any nonempty subsequence with sum $\equiv 0$ $\pmod n$ has length $=r,$ then $S$ has at most two distinct values. This proves a conjecture of R. L. Graham. A previous result of P. Erd\H{o}s and E. Szemer\'edi shows the validity of this conjecture if $n$ is a large prime number.

Affiliated with

Also associated with

No associations

Rating

Distinct Lengths Modular Zero-sum Subsequences: A Proof of Graham's Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distinct Lengths Modular Zero-sum Subsequences: A Proof of Graham's Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distinct Lengths Modular Zero-sum Subsequences: A Proof of Graham's Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-571729