![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Integers, Volume 12A
Volume 12A, 2012
- Harry J. Altman, Joshua Zelinsky:
Numbers With Integer Complexity Close to the Lower Bound. A1 - Saúl Díaz Alvarado, Andrej Dujella, Florian Luca:
On a Conjecture Regarding Balancing With Powers of Fibonacci Numbers. A2 - Michael A. Bennett:
Perfect Powers With Few Ternary Digits. A3 - Andrew R. Booker:
On Mullin's Second Sequence of Primes. A4 - David Borwein, Jonathan M. Borwein, Armin Straub, James G. Wan:
Log-Sine Evaluations of Mahler Measures, II. A5 - Graeme L. Cohen, Ronald M. Sorli:
On Odd Perfect Numbers and Even 3-Perfect Numbers. A6 - Lorenzo Di Biagio:
Euler Pseudoprimes for Half of the Bases. A7 - Paul Robert Emanuel:
Odd Incongruent Restricted Disjoint Covering Systems. A8 - Eugen J. Ionascu, Rodrigo A. Obando:
Cubes in {0, 1, ..., n}3. A9 - Lenny Jones, Daniel White:
Sierpiński Numbers in Imaginary Quadratic Fields. A10 - Zeljka Ljujic, Melvyn B. Nathanson:
On a Partition Problem of Canfield and Wilf. A11 - Aaron Meyerowitz, John L. Selfridge:
The 392 Problem. A12 - Pieter Moree:
Artin's Primitive Root Conjecture -- A Survey --. A13 - Paul Pollack, Carl Pomerance:
Prime-Perfect Numbers. A14 - Paulo Ribenboim:
Explicit Solutions of Certain Systems of Pell Equations. A15 - Samuel S. Wagstaff Jr.:
The Search for Aurifeuillian-Like Factorizations. A16 - Hugh C. Williams, Richard K. Guy:
Some Monoapparitic Fourth Order Linear Divisibility Sequences. A17
![](https://dblp.org/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.