Zobrazeno 1 - 10
of 172
pro vyhledávání: '"Table of divisors"'
Autor:
Mariusz Skałba
Publikováno v:
Bulletin of the Australian Mathematical Society. 97:11-14
Let $a_{1},a_{2},\ldots ,a_{m}$ and $b_{1},b_{2},\ldots ,b_{l}$ be two sequences of pairwise distinct positive integers greater than $1$. Assume also that none of the above numbers is a perfect power. If for each positive integer $n$ and prime number
Autor:
Rafael Jakimczuk
Publikováno v:
International Mathematical Forum. 12:331-338
Publikováno v:
Bulletin of the Korean Mathematical Society. 53:1629-1643
Autor:
Dmitry Badziahin
Publikováno v:
International journal of number theory, 2017, Vol.13(01), pp.209-228 [Peer Reviewed Journal]
We investigate the divisors [Formula: see text] of the numbers [Formula: see text] for various polynomials [Formula: see text] such that [Formula: see text]. We obtain the complete classification of such divisors for a class of polynomials, in partic
Publikováno v:
European Journal of Mathematics. 2:917-928
Following the work of Totaro and Pereira, we study sufficient conditions under which collections of pairwise-disjoint divisors on a variety over an algebraically closed field are contained in the fibers of a morphism to a curve. We prove that $\rho_w
Autor:
Mircea Merca
Publikováno v:
Journal of Number Theory. 162:23-34
The natural expression of the generating function N k ( q ) for the number of partitions of the positive integer n that have exactly k distinct values for the parts was remarked by MacMahon. A factorization of this generating function was derived lat
Autor:
Mircea Merca
Publikováno v:
Journal of Number Theory. 160:60-75
In this paper, we give a refined form of a recent factorization of Lambert series. This result allows us to prove new connections between partitions and divisors of positive integers, such as a new formula for the number of divisors of a positive int
Autor:
Mehdi Hassani
Publikováno v:
Tamkang Journal of Mathematics. 48:13-15
We study the asymptotic formula for the sum $\sum_{n\leqslant x}\o(n)$ where $\o(n)$ denotes the number of distinct prime divisors of $n$, and we perform some computations which detect curve patterns in the distribution of a related sequence.
Publikováno v:
Acta Arithmetica. :1-13
Autor:
M. E. Changa
Publikováno v:
Mathematical Notes. 97:941-945
Natural numbers all of whose prime divisors (even or odd in number) belong to special sets are considered. It is proved that numbers with an odd number of different prime divisors predominate; more precisely, the difference between these numbers not