Amanote Research

Amanote Research

    RegisterSign In

Short Intervals Asymptotic Formulae for Binary Problems With Prime Powers

Journal de Theorie des Nombres de Bordeaux - France
doi 10.5802/jtnb.1041
Full Text
Open PDF
Abstract

Available in full text

Categories
Number TheoryAlgebra
Date

January 1, 2018

Authors
Alessandro LanguascoAlessandro Zaccagnini
Publisher

Cellule MathDoc/CEDRAM


Related search

Uniform Asymptotic Formulae for Functions With Transition Points

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1950English

Automatic Abstraction for Intervals Using Boolean Formulae

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Integers Without Large Prime Factors in Short Intervals and Arithmetic Progressions

Acta Arithmetica
Number TheoryAlgebra
1999English

Asymptotic Formulae for the Lattice Point Enumerator

Canadian Journal of Mathematics
Mathematics
1999English

Statistical Formulae for Calculating Some 95% Confidence Intervals

English

Counting Roots for Polynomials Modulo Prime Powers

The Open Book Series
2019English

Sieving by Prime Powers

Acta Arithmetica
Number TheoryAlgebra
1974English

Set Systems With Restricted Intersections Modulo Prime Powers

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2001English

Some Formulae Which Match With the Prime Counting Function Infinitely Often

Notes on Number Theory and Discrete Mathematics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy