中文
相关论文

相关论文: Periodicity of the last digits of some combinatori…

200 篇论文

For any positive integer $r$, the $r$-Fubini number with parameter $n$, denoted by $F_{n,r}$, is equal to the number of ways that the elements of a set with $n+r$ elements can be weak ordered such that the $r$ least elements are in distinct…

数论 · 数学 2017-01-26 Amir Abbas Asgari , Majid Jahangiri

In this paper we study the sequences defined by the last and the last non-zero digits of $n^n$ in base $b$. For the sequence given by the last digits of $n^n$ in base $b$, we prove its periodicity using different techniques than those used…

数论 · 数学 2012-03-20 José María Grau , Antonio M. Oller-Marcén

We define an algorithm which begins with an sequence of sequences, and produces a single sequence, with following property: If at least one of the original sequences has a tail that is periodic, then the output sequence has a periodic tail,…

组合数学 · 数学 2019-05-21 George Jacobs

In 1982, Gessel showed that the Ap\'ery numbers associated to the irrationality of $\zeta(3)$ satisfy Lucas congruences. Our main result is to prove corresponding congruences for all sporadic Ap\'ery-like sequences. In several cases, we are…

数论 · 数学 2015-08-04 Amita Malik , Armin Straub

The Fubini numbers count the permutations of horse racing where ties are possible. The closely related $r$-horse numbers count the finishes of a horse race where some subset of $r$ horses agree to finish the race in a specific relative…

组合数学 · 数学 2024-12-04 Benjamin Schreyer

The existence and uniqueness (up to equivalence) of code loops was first established by R. Griess. Nevertheless, the explicit construction of code loops remained open until T. Hsu introduced the notion of symplectic cubic spaces and their…

群论 · 数学 2007-05-23 Petr Vojtěchovský

In this paper, we generalize recent work of Mizuhara, Sellers, and Swisher that gives a method for establishing restricted plane partition congruences based on a bounded number of calculations. Using periodicity for partition functions, our…

数论 · 数学 2017-04-14 Ali H. Al-Saedi

Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the…

离散数学 · 计算机科学 2017-05-03 Alexander V. Evako

Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…

组合数学 · 数学 2026-04-28 Zixian Yang , Jianchao Bai

We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…

组合数学 · 数学 2026-01-27 Dušan Dragutinović

It is known that the continued fraction expansion of a real number is periodic if and only if the number is a quadratic irrational. In an attempt to generalize this phenomenon to other settings, Jun-Ichi Tamura and Shin-Ichi Yasutomi have…

数论 · 数学 2018-10-30 Eun Hye Lee

In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence…

数论 · 数学 2015-06-11 Alexandre Laugier , Manjil P. Saikia

Natural numbers satisfying a certain unusual property are defined by the author in a previous note. Later, the author called such numbers $v$-palindromic numbers and proved a periodic phenomenon pertaining to such numbers and repeated…

数论 · 数学 2021-06-22 Daniel Tsai

Let A be a finite subset of the natural numbers containing 0, and let f(n) denote the number of ways to write n in the form $\sum e_j2^j$, where $\e_j \in A$. We show that there exists a computable T = T(A) so that the sequence (f(n) mod 2)…

Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…

组合数学 · 数学 2024-07-08 Yahia Djemmada , Abdelghani Mehdaoui , László Németh , László Szalay

We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…

统计力学 · 物理学 2007-05-23 Saul Ares , Mario Castro

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

数论 · 数学 2007-05-23 Thomas Garrity

We construct a countable family of multi-dimensional continued fraction algorithms, built out of five specific multidimensional continued fractions, and find a wide class of cubic irrational real numbers a so that either (a, a^2) or (a,…

We prove that certain sequences of finite continued fractions associated with a 2-periodic continued fraction with period a,b>0 are moment sequences of discrete signed measures supported in the interval [-1,1], and we give necessary and…

经典分析与常微分方程 · 数学 2009-02-10 Christian Berg , Antonio J. Durán

The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…

历史与综述 · 数学 2022-11-02 Trond Steihaug
‹ 上一页 1 2 3 10 下一页 ›