Related papers: Midy's Theorem in non-integer bases and divisibili…

The decimal expansion of 1/7 is 0.142857142857..., the block 142857 repeating forever. We call 142857 the period and its length is 6 = 2x3. If the period is broken into 2 pieces each of length 3 which are then added, the result is 142 + 857…

Let $b$ be a positive integer greater than 1, $N$ a positive integer relatively prime to $b$, $ |b|_{N}$ the order of $b$ in the multiplicative group $% \mathbb{U}_{N}$ of positive integers less than $N$ and relatively primes to $% N,$ and…

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

We give new characterizations of the Midy's property and using these results we obtain a new proof of a special case of the Dirichlet's theorem about primes in arithmetic progression.

Let $p>3$ be a prime and $b\ge 2$ an integer such that $p$ does not divide $b$. Then $1/p$ has a periodic digit expansion with respect to the basis $b$. The length $q$ of the period is the (multiplicative) order of $b$ mod $p$. In the case…

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…

In this note we consider fractions of the form 1/m and their floating-point representation in various arithmetic bases. For instance, what is 1/7 in base 2005? And, what about 1/4? We give a simple algorithm to answer these questions. In…

In a recent letter, new representations were proposed for the pair of sequences ($\gamma,\delta$), as defined formally by Bailey in his famous lemma. Here we extend and prove this result, providing pairs ($\gamma,\delta$) labelled by the…

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

For a fixed positive integer d, we show the existence of the limiting gap distribution measure for the sets of Farey fractions a/q of order Q with a not divisible by d, and respectively with q relatively prime with d, as Q tends to…

In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

In this paper, the estimation formula of the number of primes in a given interval is obtained by using the prime distribution property. For any prime pairs $p>5$ and $ q>5 $, construct a disjoint infinite set sequence $A_1, A_2, \ldots,…

Given a newform with the Fourier expansion $\sum_{n=1}^\infty b(n)q^n\in\mathbb Z[[q]]$, a prime $p$ is said to be non-ordinary if $p\mid b(p)$. We exemplify several newforms of weight 4 for which the latter divisibility implies a stronger…

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…

Let $p \equiv 1 \pmod{4}$ be prime, let $m$ and $n$ be integers such that $p=m^2+n^2$, and let $b$ be a positive integer. Let $Q(z,q) = (z,q/z,q;q)_{\infty}(qz^2,q/z^2;q^2)_{\infty}$ denote the product appearing in the quintuple product…

Let $Q(n)$ denote the count of the primitive subsets of the integers $\{1,2\ldots n\}$. We give a new proof that $Q(n) = \alpha^{(1+o(1))n}$ which allows us to give a good error term and to improve upon the lower bound for the value of this…

In this work we present a natural generalization of strong pseudoprime to base $b$, which we have called $q$-pseudoprime to base $b$. It allows us to present another way to define a Midy's number to base $b$ (overpseudoprime to base $b$).…

Let s_q(n) denote the base q sum of digits function, which for n<x, is centered around (q-1)/2 log_q x. In Drmota, Mauduit and Rivat's 2009 paper, they look at sum of digits of prime numbers, and provide asymptotics for the size of the set…

We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{\alpha_1}... p_s^{\alpha_s} q_1^{2\beta_1}... q_t^{2\beta_t}$ with $\beta_1, ..., \beta_t$ in some finite set S satisfies…