summary:We use the estimation of the number of integers $n$ such that $\lfloor n^c \rfloor $ belongs to an arithmetic progression to study the coprimality of integers in $\mathbb {N}^c=\{ \lfloor n^c \rfloor \}_{n\in \mathbb {N}}$, $c>1$, $c\notin \mathbb {N}$
This dissertation deals with four problems concerning arithmetic structures in densesets of integers...
A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the asso...
Title from PDF of title page (University of Missouri--Columbia, viewed on December 7, 2010).The enti...
summary:A natural number $n$ is said to be a $(k,r)$-integer if $n=a^kb$, where $k>r>1$ and $b$ is n...
summary:Let $[x]$ be an integer part of $x$ and $d(n)$ be the number of positive divisor of $n$. Ins...
International audienceIf $\mathcal{A}\subset\mathbb{N}$ is such that it does not contain a subset $S...
For every non-integral a > 1, the sequence of the integer parts of n[a](n= 1, 2, ...) is called the ...
The set P(n) of all primes equal to or less than n has the obvious property that it contains exactly...
AbstractIs it possible to find in every run of n successive positive integers an integer which is co...
AbstractUsing analytic methods, an asymptotic formula, which holds uniformly for squarefree positive...
An arithmetic progression is a sequence of numbers such that the difference between the consecutive ...
This work contains an overview of the results concerning number-theoretic pro- perties of some signi...
AbstractAn ℓ-composition of n is a sequence of length ℓ of positive integers summing up to n. In thi...
Combinatorial methods are used to prove several results in number theory. The chapters may be read i...
Given two polynomials $P(\underline x)$, $Q(\underline x)$ in one or more variables and with integer...
This dissertation deals with four problems concerning arithmetic structures in densesets of integers...
A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the asso...
Title from PDF of title page (University of Missouri--Columbia, viewed on December 7, 2010).The enti...
summary:A natural number $n$ is said to be a $(k,r)$-integer if $n=a^kb$, where $k>r>1$ and $b$ is n...
summary:Let $[x]$ be an integer part of $x$ and $d(n)$ be the number of positive divisor of $n$. Ins...
International audienceIf $\mathcal{A}\subset\mathbb{N}$ is such that it does not contain a subset $S...
For every non-integral a > 1, the sequence of the integer parts of n[a](n= 1, 2, ...) is called the ...
The set P(n) of all primes equal to or less than n has the obvious property that it contains exactly...
AbstractIs it possible to find in every run of n successive positive integers an integer which is co...
AbstractUsing analytic methods, an asymptotic formula, which holds uniformly for squarefree positive...
An arithmetic progression is a sequence of numbers such that the difference between the consecutive ...
This work contains an overview of the results concerning number-theoretic pro- perties of some signi...
AbstractAn ℓ-composition of n is a sequence of length ℓ of positive integers summing up to n. In thi...
Combinatorial methods are used to prove several results in number theory. The chapters may be read i...
Given two polynomials $P(\underline x)$, $Q(\underline x)$ in one or more variables and with integer...
This dissertation deals with four problems concerning arithmetic structures in densesets of integers...
A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the asso...
Title from PDF of title page (University of Missouri--Columbia, viewed on December 7, 2010).The enti...
DOI
Add to ORKG