Corpus ID: 14926144

Some of my old and new problems in elementary number theory and geometry

@inproceedings{Erds2004SomeOM,
  title={Some of my old and new problems in elementary number theory and geometry},
  author={Paul Erd{\"o}s},
  year={2004}
}
elementary number theory and geometry Paul Erdös I start with an old problem of mine : Denote by fk(n) the largest integer for which one can find integers 1 < al < a~ < . . .<at < n,t = fk(n) so that no k of the a's should be pairwise relatively prime . My guess was (and is) that one obtains this set by taking the first k 1 primes and the a's are the set of their multiples . Szemerédi remembers that he and Sárközy proved this if n > no(k) . I hope they will be able and willing to reconstruct… Expand
On distinct distances among points in general position and other related problems
  • A. Dumitrescu
  • Mathematics, Computer Science
  • Period. Math. Hung.
  • 2008
TLDR
It is shown that there exist n-element point sets in the plane in general position, and parallelogram free, that determine only O(n2/√log n) distinct distances, answering a question of Erdős, Hickerson and Pach. Expand

References

SHOWING 1-10 OF 12 REFERENCES
ON SEQUENCES OF INTEGERS NO ONE OF WHICH DIVIDES THE PRODUCT OF TWO OTHERS AND ON SOME RELATED PROBLEMS
The sequence of primes is both an A and a B sequence . Our A and B sequences seem of be very much more general, but our theorems show that they cannot be very much more dense than the sequence of theExpand
Note on Sequences of Integers No One of Which is Divisible By Any Other
[Extracted from the Journal of the London Mathematical Society, Vol . 1.0 (1935) .] 1 Let at , a 2 , a3 , . . . be a sequence of integers, say (A), such that am is not a divisor of an unless m = n .Expand
Ramsey Type Theorems in the Plane
TLDR
This paper shows that the answer to the question whether the points of E2 are 2-colored so that no two blue points are at distance 1 apart then there will be four red points forming a unit square is affirmative, even if one says “arbitrary four-point configuration” instead of “unit square” (Theorem 1). Expand
Extremal problems in discrete geometry
TLDR
Several theorems involving configurations of points and lines in the Euclidean plane are established, including one that shows that there is an absolute constantc3 so that whenevern points are placed in the plane not all on the same line, then there is one point on more thanc3n of the lines determined by then points. Expand
New Views on Some Old Questions of Combinatorial Geometry
Abstract : Several rather old problems in combinatorial geometry have recently been solved, mostly within the frameworks of either the theory of convex polytopes, or that of arrangements of lines orExpand
n points in the plane can determinen3/2 unit circles
  • G. Elekes
  • Mathematics, Computer Science
  • Comb.
  • 1984
TLDR
The aim of this note is to give a construction showing a set o f m unit vectors with the property that all the sums of its subsets are different (i.e. the non-trivial linear combinat ions with coefficients 0, i and I are not zero). Expand
Infinite and Finite Sets
Infinite sets can behave more strangely than finite ones, at least from the perspective of human beings, whose daily experience is of the finite. The difficulty of dealing with infinite sets wasExpand
On some problems of elementary and combinatorial geometry
SummaryThe author discusses various solved and unsolved geometrical problems all of which are of a combinatorial nature. Some are of metrical character and some are more number theoretic.
Problems and results in combinatorial number theory
© Société mathématique de France, 1975, tous droits réservés. L’accès aux archives de la collection « Astérisque » (http://smf4.emath.fr/ Publications/Asterisque/) implique l’accord avec lesExpand
unit circles, Combinatorica
  • unit circles, Combinatorica
  • 1984
...
1
2
...