中文
相关论文

相关论文: On the differences between Zumkeller and $K$-layer…

200 篇论文

In this paper we obtained an original integer sequence based on the properties of the multinomial coefficient. We investigated a property of the sequence that shows connection with a primality testing. For any prime n the n-th term in the…

组合数学 · 数学 2012-05-01 Dmitry Kruchinin

For any positive integer $n$, let $\sigma (n)$ be the sum of all positive divisors of $n.$ In this paper, it is proved that for every integer $ 1\leq k\leq 29,\ (k,30)=1, $ we have $$\sum_{n\leq K}\sigma(30n)>\sum_{n\leq K}\sigma(30n+k)$$…

数论 · 数学 2024-05-21 Rui-Jing Wang

The tangent number $T_{2n+1}$ is equal to the number of increasing labelled complete binary trees with $2n+1$ vertices. This combinatorial interpretation immediately proves that $T_{2n+1}$ is divisible by $2^n$. However, a stronger…

组合数学 · 数学 2018-02-28 Guo-Niu Han , Jing-Yi Liu

A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Yuval Filmus

A classical theorem of Baranyai states that, given integers $2\leq k < n$ such that $k$ divides $n$, one can find a family of ${n-1\choose k-1}$ partitions of $[n]$ into $k$-element subsets such that every subset appears in exactly one…

组合数学 · 数学 2024-10-14 Zoe Xi

We describe a class of fixed polyominoes called $k$-omino towers that are created by stacking rectangular blocks of size $k\times 1$ on a convex base composed of these same $k$-omino blocks. By applying a partition to the set of $k$-omino…

组合数学 · 数学 2019-10-07 Tricia Muldoon Brown

Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such…

数论 · 数学 2021-08-31 Hung V. Chu , David C. Luo , Steven J. Miller

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

组合数学 · 数学 2014-08-19 William J. Keith

A famous theorem of Szemer\'edi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a…

数论 · 数学 2007-05-23 Terence Tao

In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…

数论 · 数学 2016-03-22 Christian Reiher

For each positive integer $n$, we construct a bijection between the odd partitions and the distinct partitions of $n$ which extends Bressoud's bijection between the odd-and-distinct partitions of $n$ and the splitting partitions of $n$. We…

组合数学 · 数学 2018-03-30 John Murray

A formula on Stirling numbers of the second kind $S(n, k)$ is proved. As a corollary, for odd $n$ and even $k$, it is shown that $k!S(n, k)$ is a positive multiple of the greatest common divisor of $j!S(n, j)$ for $k+1\leq j\leq n$. Also,…

组合数学 · 数学 2019-06-21 Osamu Nishimura

Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…

组合数学 · 数学 2007-05-23 K. Alladi , A. Berkovich

Let $n$ be a squarefree positive odd integer. We will show that there exist infinitely many imaginary quadratic number fields with discriminant divisible by $n$ and-at the same time-having an element of order $n$ in the class group. We then…

数论 · 数学 2021-08-17 Meng Fai Lim

For an integer $k\ge2$, a tuple of $k$ positive integers $(M_i)_{i=1}^{k}$ is called an amicable $k$-tuple if the equation \[ \sigma(M_1)=\cdots=\sigma(M_k)=M_1+\cdots+M_k \] holds. This is a generalization of amicable pairs. An amicable…

数论 · 数学 2017-11-21 Yuta Suzuki

Let K be a number field, let f(x) in K(x) be a rational function of degree d> 1, and let z in K be a wandering point such that f^n(z) is nonzero for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many…

数论 · 数学 2014-02-26 Chad Gratton , Khoa Nguyen , Thomas J. Tucker

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

数论 · 数学 2015-01-28 Stijn S. C. Hanson

For each natural number $n$, we consider the subgroup $\mathcal{R}_n$ of Homeo$_+[0,1]$ made by the elements that are linear except for a subset whose Cantor-Bendixson rank is less than or equal to $n$. These groups of generalized…

群论 · 数学 2024-06-21 Leonardo Dinamarca Opazo

Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^{n-k+1} \equiv a \pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient…

数论 · 数学 2021-03-09 Yongyi Chen , Tae Kyu Kim

For a finite set of non-zero natural numbers that contains at least one element different from 1 and the least common multiple of any of its subsets, there exists a subset of at least half of its members which has a common divisor larger…

数论 · 数学 2018-08-29 Tom Fischer