Related papers: Polynomial Continued Fractions
In this paper, we represent a continued fraction expression of Mathieu series by a continued fraction formula of Ramanujan. As application, we obtain some new bounds for Mathieu series.
In this paper we define a new type of continued fraction expansion for a real number $x \in I_m:=[0,m-1], m\in N_+, m\geq 2$: \[x = \frac{m^{-b_1(x)}}{\displaystyle 1+\frac{m^{-b_2(x)}}{1+\ddots}}:=[b_1(x), b_2(x), ...]_m. \] Then, we…
We present a general introduction to continued fractions, with special consideration to the function fields case. These notes were prepared for a summer class given this year in Beijing at Beihang university.
Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…
Inspired by several alternative definitions of continued fraction expansions for elements in $\mathbb Q_p$, we study $p$-adically convergent periodic continued fractions with partial quotients in $\mathbb Z[1/p]$. To this end, following a…
In this article we present ways to evaluate certain sums, products and continued fractions using tools from the theory of elliptic functions. The specific results appear to be new, although similar ones can be found in the leterature; in…
Large and moderate deviation principles are proved for Engel continued fractions, a new type of continued fraction expansion with non-decreasing partial quotients in number theory.
Let $(A_n)_{n\in \mathbb{Z}}$ be a linear recurrence sequence with values in a real quadratic field. In this paper, we study the question whether the period length of the continued fraction of $A_n$ is bounded as $n$ varies. The case where…
If a continued fraction $K_{n=1}^{\infty} a_{n}/b_{n}$ is known to converge but its limit is not easy to determine, it may be easier to use an extension of $K_{n=1}^{\infty}a_{n}/b_{n}$ to find the limit. By an extension of…
A regular continuant is the denominator $K$ of a terminating regular continued fraction, interpreted as a function of the partial quotients. We regard $K$ as a function defined on the set of all finite words on the alphabet $1<2<3<\dots$…
We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…
In this paper, we shall find a new connection between $n$th degree polynomial mod $p$ congruence with $n$ roots and higher-order Fibonacci and Lucas sequences. We shall first discuss the recent work been done in sequences and their…
If the odd and even parts of a continued fraction converge to different values, the continued fraction may or may not converge in the general sense. We prove a theorem which settles the question of general convergence for a wide class of…
By using a jump transformation associated to the Romik map, we define a new continued fraction algorithm called odd-odd continued fraction, whose principal convergents are rational numbers of odd denominators and odd numerators. Among…
We investigate the analogues, in $\mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too…
A polynomial whose coeffcients are equal to its roots is called a Ulam polynomial. In this paper we show that for a given degree n there exists a finite number of Ulam polynomials of degree n.
The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…
We show that for each positive integer $a$ there exist only finitely many prime numbers $p$ such that $a$ appears an odd number of times in the period of continued fraction of $\sqrt{p}$ or $\sqrt{2p}$. We also prove that if $p$ is a prime…
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…
Inspired by the work of S. Ramanujan, many people have studied generalized modular equations and the numerous identities found by Ramanujan. These identities known as modular equations can be transformed into polynomial equations. There is…