Add to ORKGWe put the problem to determine the sets of integers in base b ≥ 2 that generate primes with using a function
AbstractIn this paper we obtain an improved asymptotic formula on the frequency of k-free numbers wi...
AbstractRecently, R. Tauraso established finite p-analogues of Apéryʼs famous series for ζ(2) and ζ(...
AbstractWe derive a lower and an upper bound for the number of binary cyclotomic polynomials Φm with...
AbstractWe prove identities of Liouville type on sums of even integer functions ranging over sets of...
In this paper problems 11, 16, 19–24, 39, 44, 46, 74, 75, 77, 82, and 176 from [10] are formalized a...
In this paper we present a method for solving the Diophantine equation, first we find the polynomial...
In this paper, we show under the abc conjecture that the Diophantine equation f(x)=u!+v! has only fi...
International audienceLet Q(N,λ) denote the number of integer solutions of the equation A^2+B^2=C^2+...
AbstractLet p≡1(mod4) be a prime and a,b∈Z with a2+b2≠p. Suppose p=x2+(a2+b2)y2 for some integers x ...
AbstractIt is known that∑k=0∞(2kk)(2k+1)4k=π2and∑k=0∞(2kk)(2k+1)16k=π3. In this paper we obtain thei...
Contains a correction with respect to the printed versionWe provide sharp estimates for the number o...
AbstractThe n-th product level of a skew–field D, psn(D), is a generalization of the n-th level of a...
AbstractLet N be sufficiently large odd integer. It is proved that the equation N=n1+n2+n3 has solut...
Below we present some methods for calculating the limits of the numerical sequence.  
AbstractLet Nq be the number of solutions of the equationa1x12+⋯+anxn2=bx1⋯xn over the finite field ...
AbstractIn this paper we obtain an improved asymptotic formula on the frequency of k-free numbers wi...
AbstractRecently, R. Tauraso established finite p-analogues of Apéryʼs famous series for ζ(2) and ζ(...
AbstractWe derive a lower and an upper bound for the number of binary cyclotomic polynomials Φm with...
AbstractWe prove identities of Liouville type on sums of even integer functions ranging over sets of...
In this paper problems 11, 16, 19–24, 39, 44, 46, 74, 75, 77, 82, and 176 from [10] are formalized a...
In this paper we present a method for solving the Diophantine equation, first we find the polynomial...
In this paper, we show under the abc conjecture that the Diophantine equation f(x)=u!+v! has only fi...
International audienceLet Q(N,λ) denote the number of integer solutions of the equation A^2+B^2=C^2+...
AbstractLet p≡1(mod4) be a prime and a,b∈Z with a2+b2≠p. Suppose p=x2+(a2+b2)y2 for some integers x ...
AbstractIt is known that∑k=0∞(2kk)(2k+1)4k=π2and∑k=0∞(2kk)(2k+1)16k=π3. In this paper we obtain thei...
Contains a correction with respect to the printed versionWe provide sharp estimates for the number o...
AbstractThe n-th product level of a skew–field D, psn(D), is a generalization of the n-th level of a...
AbstractLet N be sufficiently large odd integer. It is proved that the equation N=n1+n2+n3 has solut...
Below we present some methods for calculating the limits of the numerical sequence.  
AbstractLet Nq be the number of solutions of the equationa1x12+⋯+anxn2=bx1⋯xn over the finite field ...
AbstractIn this paper we obtain an improved asymptotic formula on the frequency of k-free numbers wi...
AbstractRecently, R. Tauraso established finite p-analogues of Apéryʼs famous series for ζ(2) and ζ(...
AbstractWe derive a lower and an upper bound for the number of binary cyclotomic polynomials Φm with...