中文
相关论文

相关论文: A recurring pattern in natural numbers of a certai…

200 篇论文

If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…

We consider a random permutation drawn from the set of permutations of length $n$ that avoid some given set of patterns of length 3. We show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after suitable…

概率论 · 数学 2018-04-18 Svante Janson

Some natural proteins display recurrent structural patterns. Despite being highly similar at the tertiary structure level, repetitions within a single repeat protein can be extremely variable at the sequence level. We propose a mathematical…

生物大分子 · 定量生物学 2015-10-12 Pablo Turjanski , R. Gonzalo Parra , Rocío Espada , Verónica Becher , Diego U. Ferreiro

In this paper, we consider sequences of polynomials that satisfy differential--difference recurrences. Our interest is motivated by the fact that polynomials satisfying such recurrences frequently appear as generating polynomials of integer…

组合数学 · 数学 2016-05-11 Pawel Hitczenko , Amanda Lohss

Let $a,b,c$ be positive integers. It is known that there are infinitely many positive integers not representated by $ax^2+by^2+cz^2$ with $x,y,z\in\mathbb Z$. In contrast, we conjecture that any natural number is represented by $\lfloor…

数论 · 数学 2015-12-24 Zhi-Wei Sun

Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…

数论 · 数学 2023-11-23 Neha Elizabeth Thomas , K Vishnu Namboothiri

We study decompositions of natural numbers into triangular summands. For instance, we prove that any natural number can be represented as a sum of four triangular numbers, two of them having even indices and the other two having odd…

数论 · 数学 2016-02-04 Dmitry Krachun

In this paper, we show that the concatenation of the Fibonacci sequence is \textit{normal} in base $10$, meaning every string of a given length, $k$, occurs as frequently as every other string of length $k$ (there are as many $1$'s as $2$'s…

数论 · 数学 2022-02-21 Brennan Benfield , Michelle Manes

We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…

数论 · 数学 2022-05-03 Peter Lynch , Michael Mackey

A number has the "collective" property if the number is the greatest lower bound of a bounded, strictly decreasing sequence on the real line. We prove that numbers with the collective property constitute an empty set.

综合数学 · 数学 2008-12-19 Guang-Liang Li , Victor O. K. Li

The Collatz variations pattern seems not to have any recurrence relation between numbers. But knowing that there is at least a natural number that converges after several iterations we construct a function $f_{X,Y}$ that is equal to the…

综合数学 · 数学 2017-02-16 Esse Koudam

We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…

数论 · 数学 2022-11-29 Joshua M. Siktar

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

离散数学 · 计算机科学 2008-11-24 Shamik Ghosh

A repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number has the form $d(10^m-1)/9$ for some $m\geq 1$ and $1 \leq d \leq 9$. Let $\left(T_n\right)_{n\ge0}$ be the sequence of Tribonacci.…

数论 · 数学 2025-09-12 Pranabesh Das , Salah Eddine Rihane , Alain Togbé

We say a natural number~$n$ is abundant if $\sigma(n)>2n$, where $\sigma(n)$ denotes the sum of the divisors of~$n$. The aliquot parts of~$n$ are those divisors less than~$n$, and we say that an abundant number~$n$ is pseudoperfect if there…

数论 · 数学 2015-04-13 Douglas E. Iannucci

A natural number $n$ is called {\it multiperfect} or {\it$k$-perfect} for integer $k\ge2$ if $\sigma(n)=kn$, where $\sigma(n)$ is the sum of the positive divisors of $n$. In this paper, we establish the structure theorem of odd multiperfect…

数论 · 数学 2011-02-23 Shi-Chao Chen , Hao Luo

Continuous and discrete time systems possessing strange non-chaotic attractors are under investigation. It is demonstrated that unpredictable trajectories exist in the dynamics. A recent numerical technique, the sequential test, is utilized…

混沌动力学 · 物理学 2021-11-01 Marat Akhmet , Mehmet Onur Fen , Astrit Tola

A double occurrence word $w$ over a finite alphabet $\Sigma$ is a word in which each alphabet letter appears exactly twice. Such words arise naturally in the study of topology, graph theory, and combinatorics. Recently, double occurrence…

组合数学 · 数学 2012-05-01 Jonathan Burns , Tilahun Muche

One source of beauty in mathematics is totally unexpected connections between two fundamentally different objects. For instance, is it not surprising that the time period of a real simple pendulum is linked with a function arising out of…

历史与综述 · 数学 2018-08-07 Alok Shukla

As far as algebraic properties are concerned, the usual addition on the class of ordinal numbers is not really well behaved; for example, it is not commutative, nor left cancellative etc. In a few cases, the natural Hessemberg sum is a…

逻辑 · 数学 2017-02-28 Paolo Lipparini