Nonaveraging sets search
A nonaveraging set is a set with no 3 terms in an arithmetic
progression. For a given n let a(n) be the smallest number
so that n-element nonaveraging set can be selected from
1,2,3,...,a(n).
I am also interested in
modular solutions as they are of great use
to construct integer solutions. A modular solution is an
n-element nonaveraging set
mod m(n), where we want to minimize m(n). Note that if m(n) is even,
then terms i and i+m(n)/2 exclude each other.
The main goal is to prove as much as possible about NrootN conjecture.
Search results: Solutions submitted
Integer records
Modular records
Warning:
Due to a bug I didn't have time to locate, for some results listed in Integer records with comment "Search" there are no solutions in the solution database: Solutions submitted. It is possible that those solutions can be somehow (using methods) derived from some solutions in the database, which are no longer records. But it is also possible that I have a more serious bug somewhere.
Therefore the results published on this website are not reliable. I apologize for that.
Jarek Wroblewski
jwr@math.uni.wroc.pl