English
Related papers

Related papers: Midy's Theorem for Periodic Decimals

200 papers

The main result of the paper is that assuming that the level $\theta$ of distribution of primes exceeds 1/2, then there exists a positive $d\leq C(\theta)$ such that there are arbitrarily long arithmetic progressions with the property that…

Number Theory · Mathematics 2010-02-16 Janos Pintz

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

Probability · Mathematics 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

The Fibonacci sequence modulo $m$, which we denote $\left(\mathcal{F}_{m,n}\right)_{n=0}^\infty$ where $\mathcal{F}_{m,n}$ is the Fibonacci number $F_n$ modulo $m$, has been a well-studied object in mathematics since the seminal paper by…

Number Theory · Mathematics 2024-03-19 Dan Guyer , aBa Mbirika , Miko Scott

The sequence of middle divisors is shown to be unbounded. For a given number $n$, $a_{n,0}$ is the number of divisors of $n$ in between $\sqrt{n/2}$ and $\sqrt{2n}$. We explicitly construct a sequence of numbers $n(i)$ and a list of…

Number Theory · Mathematics 2016-07-08 Jon Eivind Vatne

Let $x$ be a periodic continued fraction with the initial block $0$ and the repeating block $c_1,\ldots,c_n$. So $x$ is a quadratic irrational of the form $x=a+\sqrt b$, where $a$, $b$ are rational numbers, $b>0$, $b$ not a square. The…

Number Theory · Mathematics 2017-07-12 Kurt Girstmair

In 1973, Neil Sloane published a very short paper introducing an intriguing problem: Pick a decimal integer $n$ and multiply all its digits by each other. Repeat the process until a single digit $\Delta(n)$ is obtained. $\Delta(n)$ is…

Number Theory · Mathematics 2021-10-11 Eric Brier , Christophe Clavier , Linda Gutsche , David Naccache

We give 50 digits values of the simple continued fractions whose denominators are formed from a) prime numbers, b) twin primes, c) generalized $d$-twins, d) primes of the form $m^2+n^4$, e)primes of the form $m^2+1$, f) Mersenne primes and…

Number Theory · Mathematics 2010-09-28 Marek Wolf

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…

Number Theory · Mathematics 2015-07-22 Andrew N. W. Hone

Let $s(a,b)$ denote the classical Dedekind sum and $S(a,b)=12s(a,b)$. Let $k/q$, $q\in \Bbb N$, $k\in \Bbb Z$, $(k,q)=1$, be the value of $S(a,b)$. In a previous paper we showed that there are pairs $(a_r,b_r)$, $r\in\Bbb N$, such that…

Number Theory · Mathematics 2018-08-08 Kurt Girstmair

This paper concerns extension of the classical Lagrange theorem, on the eventual periodicity of continued fraction expansions of quadratic surds, and the versions of it found in the literature in the case of complex numbers. In this…

Number Theory · Mathematics 2025-12-09 S. G. Dani , Ojas Sahasrabudhe

We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…

Number Theory · Mathematics 2017-04-13 Verónica Becher , Sergio A. Yuhjtman

The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…

General Mathematics · Mathematics 2019-04-02 N. A. Carella

We prove near-optimal upper bounds for the odd moments of the distribution of coprime residues in short intervals, confirming a conjecture of Montgomery and Vaughan. As an application we prove near-optimal upper bounds for the average of…

Number Theory · Mathematics 2026-05-13 Thomas F. Bloom , Vivian Kuperberg

We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits…

Number Theory · Mathematics 2019-03-13 Jon Grantham , Witold Jarnicki , John Rickert , Stan Wagon

In 1920, P. A. MacMahon generalized the (classical) notion of divisor sums by relating it to the theory of partitions of integers. In this paper, we extend the idea of MacMahon. In doing so we reveal a wealth of divisibility theorems and…

Combinatorics · Mathematics 2023-09-07 Tewodros Amdeberhan , George E. Andrews , Roberto Tauraso

It is well known that, whenever $k$ divides $n$, the complete $k$-uniform hypergraph on $n$ vertices can be partitioned into disjoint perfect matchings. Equivalently, the set of $k$-subsets of an $n$-set can be partitioned into parallel…

Combinatorics · Mathematics 2020-07-24 Yeow Meng Chee , Tuvi Etzion , Han Mao Kiah , Alexander Vardy , Chengmin Wang

The metric Mahler measure was first studied by Dubickas and Smyth in 2001 as a means of phrasing Lehmer's conjecture in topological language. More recent work of the author examined a parametrized family of generalized metric Mahler…

Number Theory · Mathematics 2016-08-03 Charles L. Samuels

By a classical result of Weyl, for any increasing sequence $(n_k)_{k \geq 1}$ of integers the sequence of fractional parts $(\{n_k x\})_{k \geq 1}$ is uniformly distributed modulo 1 for almost all $x \in [0,1]$. Except for a few special…

Number Theory · Mathematics 2013-07-26 Christoph Aistleitner

Let x be a quadratic irrational and let P be the set of prime numbers. We show the existence of an infinite subset S of P such that the statistics of the period of the continued fraction expansions along the sequence {px: p\in S} approach…

Number Theory · Mathematics 2019-05-21 Menny Aka

NOTE: Unfortunately, most of the results mentioned here were already known under the name of "d-separated interval piercing". The result that T_d(m) exists was first proved by Gya\'rfa\'s and Lehel in 1970, see [5]. Later, the result was…

Computational Geometry · Computer Science 2010-08-03 Daniel Werner , Matthias Lenz
‹ Prev 1 3 4 5 6 7 10 Next ›