New York Number Theory Seminar
November 15, 2001, 3:30 PM
Sergei Konyagin, IAS, Princeton
- Title:
- Some combinatorial problems for squarefree numbers
- Abstract:
- Two problems in combinatorial number theory will be discussed in this
talk:
1) What is the length of the longest arithmetic progression
of squarefree numbers contained in the set {1,2,...,N}?
2) What is the cardinality of the largest subset A contained in the set
{1,2,...,N} such that for all integers a and a' in A the number a+a' is
squarefree?