相关论文: Midy's Theorem for Periodic Decimals

In this paper we show how to construct several infinite families of polynomials $D(\bar{x},k)$, such that $\sqrt{D(\bar{x},k)}$ has a regular continued fraction expansion with arbitrarily long period, the length of this period being…

Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.

We consider a family of continued fraction expansions of any number in the unit closed interval $[0,1]$ whose digits are differences of consecutive non-positive integer powers of an integer $m \geq 2$. For this expansion, we apply the…

This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.

We show that if $A=\{a_1,a_2,..., a_k\}$ is a monotone increasing set of numbers, and the differences of the consecutive elements are all distinct, then $|A+B|\geq c|A|^{1/2}|B|$ for any finite set of numbers $B$. The bound is tight up to…

A permutiple is a number which is an integer multiple of some permutation of its digits. A well-known example is 9801 since it is an integer multiple of its reversal, 1089. In this paper, we consider the permutiple problem in an entirely…

When $p(t)$ is a polynomial of degree $d$, $k$-th column of the Riordan array $\bigl(1/(1 - t^{d+1}), tp(t)\bigr)$ is an eventually periodic sequence with the repeating part beginning at the $1 + (k-1)(d+1)$-st term. The pre-periodic terms…

For an integer $c\geq 1$, let $a_c(n)$ count the number of generalized cubic partitions of $n$, which are partitions of $n$ whose even parts may appear in $c$ different colors, and $d_c(n)$ count the number of partitions obtained by adding…

A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

In this paper we examine the subset of Farey fractions of order Q consisting of those fractions whose denominators are odd. In particular, we consider the frequencies of values of numerators of differences of consecutive elements in this…

In this paper, we will first summarize known results concerning continued fractions. Then we will limit our consideration to continued fractions of quadratic numbers. The second author described periods and sometimes precise form of…

In this paper, we will introduce an extension to the Collatz's conjecture. This conjecture may be seen as a general conjecture that unifies the Collatz one together with many other similar conjectures. For instance, we propose our new…

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.…

We analyze the behavior of multipliers of a degenerating sequence of complex rational maps. We show either most periodic points have uniformly bounded multipliers, or most of them have exploding multipliers at a common scale. We further…

The Erd\H{o}s multiplication table problem asks what is the number of distinct integers appearing in the $N\times N$ multiplication table. The order of magnitude of this quantity was determined by Ford in 2008. In this paper we study the…

This article is meant to provide an additional point of view, applying known knowledge, to supply keys that have a series of non-repeating digits, in a manner that is not usually thought of. Traditionally, prime numbers are used in…

Let $A$ be a finite multiset of integers. If $B$ be a multiset such that $A$ and $B$ are $t$-complementing multisets of integers, then $B$ is periodic. We obtain the Biro-type upper bound for the smallest such period of $B$: Let…

We investigate arithmetic properties of the sequence b(n) = B_MN(n) mod M obtained from the base-M to base-N shift map B_MN.We prove that b(n) is ultimately periodic exactly when every prime divisor of M also divides N; in that case we…

Consider a random permutation of $kn$ objects that permutes $n$ disjoint blocks of size $k$ and then permutes elements within each block. Normalizing its cycle lengths by $kn$ gives a random partition of unity, and we derive the limit law…