The work covers the additive properties of multiplicative functions. The aim is to deduce the asymptotic formulae for a number of the integer representation in the Diophantine equations and to construct the theory for evaluating sums of the Dirichlet characters. The theory of algebraic numbers, variants of circular method and also the methods for evaluations of the trigonometric sums and Dirichlet character sums from polynomials and rational functions have been applied. The asymptotic formulae for number of the integer representations in the Diophantine equations have been obtained, the theory for evaluating total sums of the Dirichlet characters from polynomials and rational functions has been constructed. The results can find application ...
Investigations in the field of the analytical theory of numbers are considered in the paper aiming a...
Quite frequently in the study of number theory we become acquainted with special functions which are...
AbstractAt the end of the 1970ʼs, G.P. Egorychev developed a method of coefficients, which found suc...
In this thesis, the reader is provided with a self-contained study of multiplicative charactersmodul...
The asymptotical formula obtaining for the quantity of divisors of numbers [n_c], c<1, n greater ...
We consider a set of tickets with numbers from 000001 to 999999. The lucky ticket is called, in whic...
This dissertation focuses on three problems in analytic number theory, one of a multiplicative natur...
The thesis discusses classical number theory problems on representations of integers by sums of two,...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
This thesis considers four distinct problems in the area of exponential and character sums. The stra...
This bachelor's thesis summarizes and systematizes knowledge about congruences and linear Diophantin...
We give upper bounds for sums of multiplicative characters modulo an integer q ≧ 2 with the Euler fu...
Let r(2)(n) denote the number of representations of the positive integer n as a sum of two squares, ...
International audienceGiven a multiplicative function~$f$ which is periodic over the primes, we obta...
2000 Mathematics Subject Classification: 11D75, 11D85, 11L20, 11N05, 11N35, 11N36, 11P05, 11P32, 11P...
Investigations in the field of the analytical theory of numbers are considered in the paper aiming a...
Quite frequently in the study of number theory we become acquainted with special functions which are...
AbstractAt the end of the 1970ʼs, G.P. Egorychev developed a method of coefficients, which found suc...
In this thesis, the reader is provided with a self-contained study of multiplicative charactersmodul...
The asymptotical formula obtaining for the quantity of divisors of numbers [n_c], c<1, n greater ...
We consider a set of tickets with numbers from 000001 to 999999. The lucky ticket is called, in whic...
This dissertation focuses on three problems in analytic number theory, one of a multiplicative natur...
The thesis discusses classical number theory problems on representations of integers by sums of two,...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
This thesis considers four distinct problems in the area of exponential and character sums. The stra...
This bachelor's thesis summarizes and systematizes knowledge about congruences and linear Diophantin...
We give upper bounds for sums of multiplicative characters modulo an integer q ≧ 2 with the Euler fu...
Let r(2)(n) denote the number of representations of the positive integer n as a sum of two squares, ...
International audienceGiven a multiplicative function~$f$ which is periodic over the primes, we obta...
2000 Mathematics Subject Classification: 11D75, 11D85, 11L20, 11N05, 11N35, 11N36, 11P05, 11P32, 11P...
Investigations in the field of the analytical theory of numbers are considered in the paper aiming a...
Quite frequently in the study of number theory we become acquainted with special functions which are...
AbstractAt the end of the 1970ʼs, G.P. Egorychev developed a method of coefficients, which found suc...