中文
相关论文

相关论文: On the $2$-adic valuation of $\sigma_k(n)$

200 篇论文

Let $k\ge 2$ and $\Pi(n)=\prod_{i=1}^k(a_in+b_i)$ for some integers $a_i, b_i$ ($1\le i\le k$). Suppose that $\Pi(n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that $\Omega(\Pi(n))\le r_k$…

数论 · 数学 2012-05-22 James Maynard

Let $\sigma(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma}n \log \log n$ holds for every positive integer $n \geq…

数论 · 数学 2021-11-01 Christian Axler

A conjecture predicting an injective and surjective mapping $X = \displaystyle\frac{\sigma(p^k)}{p^k}, Y = \displaystyle\frac{\sigma(m^2)}{m^2}$ between OPNs $N = {p^k}{m^2}$ (with Euler factor $p^k$) and rational points on the hyperbolic…

数论 · 数学 2013-10-17 Jose Arnaldo B. Dris

Let $p^k m^2$ be an odd perfect number with special prime $p$. In this article, we provide an alternative proof for the biconditional that $\sigma(m^2) \equiv 1 \pmod 4$ holds if and only if $p \equiv k \pmod 8$. We then give an application…

数论 · 数学 2020-07-07 Jose Arnaldo Bebita Dris , Immanuel Tobias San Diego

Let $n$ and $k$ be positive integers. We denote by $v_2(n)$ the 2-adic valuation of $n$. The Stirling numbers of the first kind, denoted by $s(n,k)$, counts the number of permutations of $n$ elements with $k$ disjoint cycles. In recent…

数论 · 数学 2018-12-12 Min Qiu , Shaofang Hong

Let $\sigma(n)$ be the sum of the positive divisors of $n$. A number $n$ is said to be 2-near perfect if $\sigma(n) = 2n +d_1 +d_2 $, where $d_1$ and $d_2$ are distinct positive divisors of $n$. We give a complete description of those $n$…

For all integers $n \geq k \geq 1$, define $H(n,k) := \sum 1 / (i_1 \cdots i_k)$, where the sum is extended over all positive integers $i_1 < \cdots < i_k \leq n$. These quantities are closely related to the Stirling numbers of the first…

数论 · 数学 2017-08-29 Paolo Leonetti , Carlo Sanna

If $ p_k(a,m,n) $ denotes the number of partitions of $n$ into $k$th powers with a number of parts that is congruent to $ a $ modulo $m,$ then $p_2(0,2,n)\sim p_2(1,2,n)$ and the sign of the difference $p_2(0,2,n)- p_k(1,2,n)$ alternates…

数论 · 数学 2021-02-03 Alexandru Ciolan

The partial Stirling numbers T_n(k) used here are defined as the sum over odd values of i of (n choose i) i^k. Their 2-exponents nu(T_n(k)) are important in algebraic topology. We provide many specific results, applying to all values of n,…

数论 · 数学 2011-09-23 Donald M. Davis

For a positive integer $n$, if $\sigma(n)$ denotes the sum of the positive divisors of $n$, then $n$ is called a deficient perfect number if $\sigma(n)=2n-d$ for some positive divisor $d$ of $n$. In this paper, we prove some results about…

数论 · 数学 2019-06-25 Parama Dutta , Manjil P. Saikia

The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…

组合数学 · 数学 2018-08-28 Samuel D. Judge , William J. Keith , Fabrizio Zanello

For positive integers $k$ and $n$ let $\sigma_k(n)$ denote the sum of the $k$th powers of the divisors of $n$. Erd\H{o}s and Kac asked whether, for every $k$, the number $\alpha_k = \sum_{n\geq 1} \frac{\sigma_k(n)}{n!}$ is irrational. It…

数论 · 数学 2022-09-23 Kyle Pratt

A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs) is one of the longest unsolved problems…

数论 · 数学 2014-07-04 Jose Arnaldo B. Dris

Let $d_k(n) = \sum_{n_1 \cdots n_k = n}1$ be the $k$-fold divisor function. We call a function $f:\mathbb{N} \to \mathbb{C}$ a $d_k$-bounded multiplicative function, if $f$ is multiplicative and $|f(n)| \leq d_k(n)$ for every $n \in…

数论 · 数学 2024-06-17 Yu-Chen Sun

In number theory, we know Legendre's formula $ v_p(n!) = \sum_{k \ge 1} \lfloor \frac{n}{p^k} \rfloor $, which calculates the $p$-adic valuation of the factorial, i.e. the exponent of the greatest power of a prime $p$ that divides $n!$.…

数论 · 数学 2019-07-30 Gennady Eremin

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…

数论 · 数学 2012-04-10 Victor J. W. Guo , Jiang Zeng

Let $n$ and $k$ be positive integers and $\sigma(n)$ the sum of all positive divisors of $n$. We call $n$ an exactly $k$-deficient-perfect number with deficient divisors $d_1, d_2, \ldots, d_k$ if $d_1, d_2, \ldots, d_k$ are distinct proper…

数论 · 数学 2020-01-22 Saralee Aursukaree , Prapanpong Pongsriiam

We show that if p is an odd prime then $$\sum_{k=0}^{p-1}E_kE_{p-1-k}=1 (mod p)$$ and $$\sum_{k=0}^{p-3}E_kE_{p-3-k}=(-1)^{(p-1)/2}2E_{p-3} (mod p),$$ where E_0,E_1,E_2,... are Euler numbers. Moreover, we prove that for any positive integer…

数论 · 数学 2010-12-22 Zhi-Wei Sun

Let $p$ be an odd prime, and let $m$ be an integer with $p\nmid m$. In this paper show that $$\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak\binom{-1-a}k}{m^k} \equiv 0\pmod p \quad\hbox{implies}\quad\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak…

数论 · 数学 2015-03-12 Zhi-Hong Sun

Acquaah and Konyagin showed that if $N$ is an odd perfect number where $N= p_1^{a_1}p_2^{a_2} \cdots p_k^{a_k}$ where $p_1 < p_2 \cdots < p_k$ then one must have $p_k < 3^{1/3}N^{1/3}$. Using methods similar to theirs, we show that…

数论 · 数学 2018-12-18 Joshua Zelinsky