相关论文: A Theorem involving the denominators of Bernoulli …

An integer $k$ is called regular (mod $n$) if there exists an integer $x$ such that $k^2x\equiv k$ (mod $n$). This holds true if and only if $k$ possesses a weak order (mod $n$), i.e., there is an integer $m\ge 1$ such that $k^{m+1} \equiv…

We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…

If $N = {q^k}{n^2}$ is an odd perfect number, where $q$ is the Euler prime, then we show that $n < q$ is sufficient for Sorli's conjecture that $k = \nu_{q}(N) = 1$ to hold. We also prove that $q^k < 2/3{n^2}$, and that $I(q^k) < I(n)$,…

Congruences modulo prime powers involving generalized Harmonic numbers are known. While looking for similar congruences, we have encountered a curious triangular array of numbers indexed with positive integers $n,k$, involving the Bernoulli…

We study the average number of representations of an integer $n$ as $n = \phi(n_{1}) + \dots + \phi(n_{j})$, for polynomials $\phi \in \mathbb{Z}[n]$ with $\partial\phi = k\ge 1$, $\operatorname{lead}(\phi) = 1$, $j \ge k$, where $n_{i}$ is…

Bertrand's postulate establishes that for all positive integers $n>1$ there exists a prime number between $n$ and $2n$. We consider a generalization of this theorem as: for integers $n\geq k\geq 2$ is there a prime number between $kn$ and…

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

Let $\{\cdot\}$ denote the fractional part and $n \geq 1$ be a fixed integer. In this short note, we show for any prime $p$ the one-to-one correspondence $$\sum_{\nu \geq 1} \left\{\frac{n}{p^\nu}\right\} > 1 \quad \iff \quad p \mid…

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…

For an integer $ k\geq 2 $, let $ \{F^{(k)}_{n} \}_{n\geq 0}$ be the $ k$--generalized Fibonacci sequence which starts with $ 0, \ldots, 0, 1 $ ($ k $ terms) and each term afterwards is the sum of the $ k $ preceding terms. In this paper,…

Let $\ell$ be any fixed prime number. We define the $\ell$-Genocchi numbers by $G_n:=\ell(1-\ell^n)B_n$, with $B_n$ the $n$-th Bernoulli number. They are integers. We introduce and study a variant of Kummer's notion of regularity of primes.…

For integer $k \geq 0$, let $S_k$ denote the sum of the $k$th powers of the first $n$ positive integers $1^k + 2^k + \cdots + n^k$. For any given $k$, the power sum $S_k$ can in principle be determined by differentiating $k$ times (with…

Let $\mathbb{K}$ be a number field of degree $n$ over $\mathbb{Q}$. Let $\widehat{\mathbb{A}}$ be the set of integers of $\mathbb{K}$ which are primitive over $\mathbb{Q}$ and $I(\mathbb{K})$ be its index. Gunji and McQuillan defined the…

For any integer $k$, M.Kaneko defined $k$-th poly-Bernoulli numbers as a kind of generalization of classical Bernoulli numbers using $k$-th polylogarithm. In case when $k$ is positive, $k$-th poly-Bernoulli numbers is a sequence of rational…

Let a(n,k) be the kth coefficient of the nth cyclotomic polynomial. The first two authors showed in part I that if m is a prime power and n and k range over the non-negative integers, then a(mn,k) assumes every integer value. Here this…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

We give a characterization of all pairs $(k,n)$ of positive integers for which the ratio $$ \frac{1^k-2^k+3^k-\dots+(-1)^{n+1} n^k}{1^k-2^k+3^k-\dots+(-1)^{n}(n-1)^k} $$ of two consecutive alternating power sums is an integer.

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…