Some solved and unsolved problems in combinatorial number theory, ii

P. Erdős; A. Sárközy

Displaying similar documents to “Some solved and unsolved problems in combinatorial number theory, ii”

On the number of pairs of partitions of n without common subsums

P. Erdős, J. Nicolas, A. Sárközy (1992)

Colloquium Mathematicae

Similarity:

Discrepancy estimates for a class of normal numbers

Yoshinobu Nakai, Iekata Shiokawa (1992)

Acta Arithmetica

Similarity:

Functions of slow increase and integer sequences.

Jakimczuk, Rafael (2010)

Journal of Integer Sequences [electronic only]

Similarity:

Power-free values, large deviations, and integer points on irrational curves

Harald A. Helfgott (2007)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let $f \in ℤ [x]$ be a polynomial of degree $d \geq 3$ without roots of multiplicity $d$ or $(d - 1)$ . Erdős conjectured that, if $f$ satisfies the necessary local conditions, then $f (p)$ is free of $(d - 1)$ th powers for infinitely many primes $p$ . This is proved here for all $f$ with sufficiently high entropy. The proof serves to demonstrate two innovations: a strong repulsion principle for integer points on curves of positive genus, and a number-theoretical analogue of Sanov’s theorem from the theory of large deviations. ...

Asymptotic behavior for the best lower bound of Jensen's functional

Stojan Radenović, Mirjana Pavlović (2003)

Kragujevac Journal of Mathematics

Similarity:

The divisor problem for binary cubic forms

Tim Browning (2011)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We investigate the average order of the divisor function at values of binary cubic forms that are reducible over $ℚ$ and discuss some applications.

Lower bounds for a certain class of error functions

J. Herzog, P. R. Smith (1992)

Acta Arithmetica

Similarity: