[seqfan] Re: Intersecting circles
Andrew Weimholt
andrew.weimholt at gmail.com
Sun Mar 9 10:11:07 CET 2014
If I understand the problem correctly, then an upper bound
is given by n*(n-1)^3, which (for n>1) is A179824.
Andrew
On Sat, Mar 8, 2014 at 5:10 PM, Charles Greathouse <
charles.greathouse at case.edu> wrote:
> My friend Michael asks this question: Given n (distinct) points in R^2,
> what is the smallest/largest number of points on the intersections of two
> circles, where for every pair (p1, p2) of points there is a circle drawn
> with center p1 and radius |p1 - p2|?
>
> This seems beautiful enough that I suspect that the sequences are already
> in the OEIS, either as-is or with appropriate degeneracy conditions
> (noncolinear?). Any help?
>
> Charles Greathouse
> Analyst/Programmer
> Case Western Reserve University
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>
More information about the SeqFan
mailing list