We consider a set of tickets with numbers from 000001 to 999999. The lucky ticket is called, in which the sum of the first three digits equals the sum of the last three digits. The problem of lucky tickets is counting their number. The generalization of the classical problem of the lucky ticket to the case when the number of terms in comparable amounts and different radix arbitrarily. To count the number of solutions of linear diophantine equations, the terms of which are bounded by a constant, we introduced a discrete analogue of the delta function, written as the definite integral. We wrote out the formula for the number of tickets in the form of multiple sums comprising administering function. We prove several auxiliary identities for th...
AbstractWe obtain the asymptotic formulae ∣B∩V∣=(∣B∣/p)+O(√∣B∣log2p) for the number of solutions of ...
A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the asso...
We study the number P(n) of partitions of an integer n into sums of distinct squares and derive an i...
Consideration is given to an asymmetric ticket of length (Formula presented.) in base (Formula prese...
Consideration is given to an asymmetric ticket of length in base . Such a ticket is said to be -luck...
The work covers the additive properties of multiplicative functions. The aim is to deduce the asympt...
1. Introduction. It is only within the past couple of years that the Davenport-Heilbronn method, now...
The author had initiated a revision and translation of "Classical Diophantine Equations" prior to hi...
We reduce the number of variables required to guarantee the validity of the classical asymptotic for...
We study the Diophantine system{ x1 + · · ·+ xn = a, x3 1 + · · ·+ x3n = b, where a, b ∈ Q, ab 6 =...
Abstract. In this paper, we prove a weaker form of a conjecture of Mohanty and Ramasamy [6] concerni...
An asymptotic formula for p(n), precise enough to give the exact value, was given by Hardy and Raman...
The resolution of each new diophantine equation is a peculiar problem. This is what the reader has c...
International audienceA nontrivial solution of the equation A!B! = C! is a triple of positive intege...
For any positive integer k let φ(k), σ(k), and τ(k) be the Euler function of k, the divisor sum func...
AbstractWe obtain the asymptotic formulae ∣B∩V∣=(∣B∣/p)+O(√∣B∣log2p) for the number of solutions of ...
A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the asso...
We study the number P(n) of partitions of an integer n into sums of distinct squares and derive an i...
Consideration is given to an asymmetric ticket of length (Formula presented.) in base (Formula prese...
Consideration is given to an asymmetric ticket of length in base . Such a ticket is said to be -luck...
The work covers the additive properties of multiplicative functions. The aim is to deduce the asympt...
1. Introduction. It is only within the past couple of years that the Davenport-Heilbronn method, now...
The author had initiated a revision and translation of "Classical Diophantine Equations" prior to hi...
We reduce the number of variables required to guarantee the validity of the classical asymptotic for...
We study the Diophantine system{ x1 + · · ·+ xn = a, x3 1 + · · ·+ x3n = b, where a, b ∈ Q, ab 6 =...
Abstract. In this paper, we prove a weaker form of a conjecture of Mohanty and Ramasamy [6] concerni...
An asymptotic formula for p(n), precise enough to give the exact value, was given by Hardy and Raman...
The resolution of each new diophantine equation is a peculiar problem. This is what the reader has c...
International audienceA nontrivial solution of the equation A!B! = C! is a triple of positive intege...
For any positive integer k let φ(k), σ(k), and τ(k) be the Euler function of k, the divisor sum func...
AbstractWe obtain the asymptotic formulae ∣B∩V∣=(∣B∣/p)+O(√∣B∣log2p) for the number of solutions of ...
A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the asso...
We study the number P(n) of partitions of an integer n into sums of distinct squares and derive an i...