English
Related papers

Related papers: The length of the repeating decimal

200 papers

A permutiple is the product of a digit preserving multiplication, that is, a number which is an integer multiple of some permutation of its digits. Certain permutiple problems, particularly transposable, cyclic, and, more recently,…

Number Theory · Mathematics 2017-01-30 Benjamin V. Holt

Classical crystals are solid materials containing arbitrarily long periodic repetitions of a single motif. In this paper, we study the maximal possible repetition of the same motif occurring in beta-integers -- one dimensional models of…

Combinatorics · Mathematics 2013-02-12 L. Balková , K. Klouda , E. Pelantová

Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…

Combinatorics · Mathematics 2024-04-10 Pedro A. García-Sánchez , Laura González , Francesc Planas-Vilanova

A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of…

Formal Languages and Automata Theory · Computer Science 2014-12-02 Golnaz Badkobeh , Gabriele Fici , Zsuzsanna Lipták

The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Golnaz Badkobeh , Maxime Crochemore

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

Symbolic Computation · Computer Science 2011-01-04 Mark Giesbrecht , Daniel S. Roche , Hrushikesh Tilak

There has been always an ambiguity in division when zero is present in the denominator. So far this ambiguity has been neglected by assuming that division by zero as a non-allowed operation. In this paper, I have derived the new set of…

General Mathematics · Mathematics 2011-07-07 Mohd Abubakr

This article considers the error term of the primes counting function. It applies some recent results on the densities of prime numbers in short intervals to derive an improvement of the error term from subexponential size to fractional…

General Mathematics · Mathematics 2009-08-12 N. A. Carella

The purpose of this paper is to introduce the concept of reflecting numbers to the realm of number theory and to classify reflecting numbers of certain types. For us, reflecting numbers are coming from congruent numbers, above congruent…

Number Theory · Mathematics 2022-07-07 Ya-Qing Hu

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

Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…

Dynamical Systems · Mathematics 2024-12-09 Niels Langeveld , David Ralston

An interesting open problem in number theory asks whether it is possible to walk to infinity on primes, where each term in the sequence has one more digit than the previous. In this paper, we study its variation where we walk on the…

Number Theory · Mathematics 2022-08-30 Steven J. Miller , Fei Peng , Tudor Popescu , Nawapan Wattanawanichkul

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

Combinatorics · Mathematics 2024-09-25 Aaron Abrams , Eric Babson , Henry Landau , Zeph Landau , James Pommersheim

In a prime number decomposition of integers in a given set, the occurrence frequencies of prime numbers are shown to satisfy a general forms of Zipf's law.

Physics and Society · Physics 2024-03-20 Helmut Satz

We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…

General Mathematics · Mathematics 2021-06-08 Marc Wolf , FranÇOis Wolf , FranÇOis-Xavier Villemin

A new derivative, called deformable derivative, is introduced here which is equivalent to ordinary derivative in the sense that one implies other. The deformable derivative is defined using limit approach like that of ordinary one but with…

Classical Analysis and ODEs · Mathematics 2017-05-03 Fahed Zulfeqarr , Amit Ujlayan , Priyanka Ahuja

Let $p$ be a prime $\equiv 3$ mod 4, $p>3$, and suppose that 10 has the order $(p-1)/2$ mod p. Then $1/p$ has a decimal period of length $(p-1)/2$. We express the frequency of each digit $0,\ldots,9$ in this period in terms of the class…

Number Theory · Mathematics 2026-04-28 Kurt Girstmair

Our purpose is to give an account of the $r$-tuple problem on the increasing sequence of reduced fractions having denominators bounded by a certain size and belonging to a fixed real interval. We show that when the size grows to infinity,…

Number Theory · Mathematics 2007-06-13 Cristian Cobeli , Alexandru Zaharescu

Given a positive rational number $n/d$ with $d$ odd, its odd greedy expansion starts with the largest odd denominator unit fraction at most $n/d$, adds the largest odd denominator unit fraction so the sum is at most $n/d$, and continues as…

Number Theory · Mathematics 2023-09-15 Joel Louwsma , Joseph Martino

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