中文
相关论文

相关论文: A Flanking Pattern in a Sum-of-Divisors Congruence

200 篇论文

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

In this paper, we study some properties of a certain kind of permutation $\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The desired properties for $\sigma$ are: (1) the algebraic degree of each component function is…

密码学与安全 · 计算机科学 2019-07-12 Claude Gravel , Daniel Panario , David Thomson

An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…

组合数学 · 数学 2014-01-14 Robert Brignall , Nik Ruskuc , Vince Vatter

The Franel numbers are defined by $ f_n=\sum_{k=0}^n {n\choose k}^3. $ Motivated by the recent work of Z.-W. Sun on Franel numbers, we prove that \begin{align*} \sum_{k=0}^{n-1}(3k+1)(-16)^{n-k-1} {2k\choose k} f_k &\equiv…

数论 · 数学 2014-04-29 Victor J. W. Guo

Let $a_1 = 1$ and, for $n > 1$, $a_n = a_{n-1} + a_{\left \lfloor \frac{n}{2} \right \rfloor}$. In this paper we will look at congruence properties and the growth rate of this sequence. First we will show that if $x \in \{1, 2, 3, 5, 6, 7…

数论 · 数学 2024-06-17 Wouter van Doorn

We investigate the divisibility properties of \sigma(C_n), the sum-of-divisors function applied to Catalan numbers, in relation to other number-theoretic functions. We establish conditions under which C_n has prime factors of the form 6k-1,…

组合数学 · 数学 2025-02-10 Volkan Yildiz

In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5))…

数论 · 数学 2009-12-20 Zhi-Wei Sun

An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted…

组合数学 · 数学 2015-04-03 Steffen Eger

Let $p(n)$ be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form $p( Q^3 \ell n+\beta)\equiv0\pmod\ell$ where $\ell$ and $Q$ are prime and $5\leq \ell\leq 31$; these lie in two natural…

数论 · 数学 2022-07-20 Scott Ahlgren , Patrick B. Allen , Shiang Tang

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

组合数学 · 数学 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen

The problem of simplicity of Fermat number-twins $f_{n}^{\pm}=2^{2^n}\pm3$ is studied. The question for what $n$ numbers $f_{n}^{\pm}$ are composite is investigated. The factor-identities for numbers of a kind $x^2 \pm k $ are found.

综合数学 · 数学 2007-07-09 Boris V. Tarasov

In this paper we characterize, in terms of the prime divisors of $n$, the pairs $(k,n)$ for which $n$ divides $\sum_{j=1}^n j^{k}$. As an application, we study the sets $\mathcal{M}_f :=\{n: n \textrm{divides} \sum_{j=1}^n j^{f(n)} \}$ for…

数论 · 数学 2013-04-10 José María Grau , Antonio M. Oller-Marcén

We investigate properties of families $F$ of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any $A\notin F$, there is such set $A'\in F$ that either $A\subset A'$ or…

离散数学 · 计算机科学 2013-04-17 B. S. Kochkarev

Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…

离散数学 · 计算机科学 2023-06-22 Murray Tannock , Michael Albert

We study convergence properties of sparse averages of partial sums of Fourier series of continuous functions. By sparse averages, we are considering an increasing sequences of integers $n_0 < n_1 < n_2 < ...$ and looking at…

经典分析与常微分方程 · 数学 2019-03-19 Ethan Goolish , Robert S. Strichartz

A k-composition of n is a sequence of length k of positive integers summing up to n. In this paper, we investigate the number of k-compositions of n satisfying two natural coprimality conditions. Namely, we first give an exact asymptotic…

数论 · 数学 2012-02-09 Daniela Bubboloni , Florian Luca , Pablo Spiga

For a fixed prime $p$, we consider a filtration of the commuting complex of elements of order $p$ in the symmetric group $\mathfrak{S}_n$. The filtration is obtained by imposing successively relaxed bounds on the number of disjoint…

群论 · 数学 2018-08-23 Cihan Bahran

Let $A,B\subset\mathbb{R}$. Define $$A\cdot B=\{x\cdot y:x\in A, y\in B\}.$$ In this paper, we consider the following class of self-similar sets with overlaps. Let $K$ be the attractor of the IFS $\{f_1(x)=\lambda x, f_2(x)=\lambda…

动力系统 · 数学 2018-07-17 Li Tian , Jiangwen Gu , Qianqian Ye , Lifeng Xi , Kan Jiang

In this paper, we investigate the stabilizers of certain multisets $\mod p^k$ with respect to their natural multiplicative action, completely describing them for a certain family of polynomials whenever $p$ is an odd prime. This elucidates…

数论 · 数学 2023-05-10 Samuel Goodman