What is the least possible cardinality $K$, of a set S of points in the plane, such that there exists a point P in the plane and an open ball B centered at P, such that for all points X in B, not all the euclidean distances from X to points of S are rational?


Can we do better then $3\leq K \leq 2^{\aleph\_0}$?


What can be said about K if all the points of S must be at integer distance from eachother, can it be proved to be finite?



Least cardinality of a set of points in the plane
As Boris Bukh points out, three points suffice, but I'd like to point out that your question is related to this [MO question](https://mathoverflow.net/questions/54104/drawing-planar-graphs-with-integer-edge-lengths). 


Here is a summary of the information in the previous question. For the second part of your question, the author (me) conjectures that for any finite set $S$ with all rational distances, no such point $P$ exists. As I noted in the comments, this is true when $|S|=3$, proven by Almering.


It is not known if there is a point with all rational distances to the unit square. However, it is known that there are no points at rational distance from all vertices of a regular $n$-gon, except perhaps when $n=4,6,8,12,24$. 


Some more tangential remarks are that it is not known if there is a dense set of points in the plane with all distances rational, although it is conjectured that there is none.


Even more tangential, it is not known if every planar graph can be straight-line embedded in the plane with all edges having rational length, although it is conjectured to be true. 


