![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Integers, Volume 15A
Volume 15A, 2015
Proceedings of Integers 2013: The Erdős Centennial Conference
- Dorin Andrica, Eugen J. Ionascu:
The Signum Equation for Erdős-Surányi Sequences. A1 - Tom Brown:
Monochromatic Solutions of Exponential Equations. A2 - Kyle Burke:
23 Quantified Boolean Formula Games and Their Complexities. A3 - Aviezri S. Fraenkel, Nhan Bao Ho:
When are Translations of P-positions of Wythoff's Game P-positions? A4 - Anant P. Godbole, Samuel C. Gutekunst, Vince Lyzinski, Yan Zhuang:
Logarithmic Representability of Integers as k-Sums. A5 - Katalin Gyarmati, András Sárközy:
On Reducible and Primitive Subsets of Fp, I. A6 - Joshua Harrington, Lenny Jones:
Extending a Theorem of Pillai to Quadratic Sequences. A7 - Mario Huicochea, Amanda Montejano:
The Structure of Rainbow-free Colorings for Linear Equations on Three Variables in Zp. A8 - Renling Jin:
Detailed Structure for Freiman's 3k-3 Theorem. A9 - Lenny Jones, Alicia Lamarche:
Generating d-Composite Sandwich Numbers. A10 - William J. Keith:
Congruences for m-regular Partitions Modulo 4. A11 - Neil Lyall, Alex Rice:
A Quantitative Result on Diophantine Approximation for Intersective Polynomials. A12 - Paul Pollack:
Palindromic Sums of Proper Divisors. A13 - Melkamu Zeleke, Mahendra Jani:
On Subsets of Ordered Trees Enumerated by a Subsequence of Fibonacci Numbers. A14
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.