Related papers: Early Record of Divisibility and Primality

We investigate the distributions of the orbital period ratios of adjacent planets in high multiplicity \kepler\ systems (four or more planets) and low multiplicity systems (two planets). Modeling the low multiplicity sample as essentially…

In Butler, J.Differential Geom. 39 (1):1--34,1994, the author gives a sufficient condition for a line bundle associated with a divisor D to be normally generated on $X=P(E)$ where E is a vector bundle over a smooth curve C. A line bundle…

Wall published a paper in 1960 on the Fibonacci sequence where he derived many results concerning the period and prime power divisibility modulo m. His periodicity results have been generalized to second order linear recurrences. Here we…

We establish an explicit inequality for the number of divisors of an integer $n$. It uses the size of $n$ and its number of distinct prime divisors.

When people mention the mathematical achievements of Euclid, his geometrical achievements always spring to mind. But, his Number-Theoretical achievements (See Books 7, 8 and 9 in his magnum opus \emph{Elements} [1]) are rarely spoken. The…

We have summarized here the astronomical knowledge of the ancient Hindu astronomers. This knowledge was accumulated from before 1500 B.C. up to around 1200 A.D. In Section \ref{equiv} we have correlated terms used by the Hindu astronomers…

In point of fact the Indian tradition in mathematics is long and glorious. It dates back to earliest times, and indeed many of the Indian discoveries from 5000 years ago correspond rather naturally to modern mathematical results.

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

We give a relatively short proof of one of the central cases of the main theorem from the paper "The distribution of integers with a divisor in a given interval", math.NT/0401223. Namely, we determine the order of magnitude of the number of…

The biquaternion (complexified quaternion) algebra contains idempotents (elements whose square remains unchanged) and nilpotents (elements whose square vanishes). It also contains divisors of zero (elements with vanishing norm). The…

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…

In the middle of the third millennium BC the Sumerians must have noticed that the reciprocal of the number 7,in contrast to the numbers 1,2,3,4,5,and 6,could not be expressed by a finite sexagesimal fraction but it recurred every three…

Let $(b_n) = (b_1, b_2, ...)$ be a sequence of integers. A primitive prime divisor of a term $b_k$ is a prime which divides $b_k$ but does not divide any of the previous terms of the sequence. A zero orbit of a polynomial $f(z)$ is a…

D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…

We studied 93 asteroid pairs. We estimated times elapsed since separation of pair members that are between 7*10^3 and a few 10^6 yr. We derived the rotation periods for all the primaries and a sample of secondaries. We derived the absolute…

Egyptian decompositions of 2/D as a sum of two unit fractions are studied by means of certain divisors of D, namely r and s. Our analysis does not concern the method to find r and s, but just why the scribes have chosen a solution instead…

In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their…

The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…

Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…

In this paper we establish a formal connection between the structure of ideals in integers rings and the theory of additive combinatorics. For integers rings with cyclic class groups, we prove a structural theorem demonstrating that every…