Related papers: A Clean Approach to Rational Cubic Residues

We prove that the enumerative geometry of lines on smooth cubic surfaces is governed by the arithmetic of the base field. In 1949, Segre proved that the number of lines on a smooth cubic surface over any field is 0, 1, 2, 3, 5, 7, 9, 15, or…

Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…

Given a primitive, non-CM, holomorphic cusp form $f$ with normalized Fourier coefficients $a(n)$ and given an interval $I\subset [-2, 2]$, we study the least prime $p$ such that $a(p)\in I$ . This can be viewed as a modular form analogue of…

Let $b \geq 2$ be an integer and $S$ be a finite non-empty set of primes not containing divisors of $b$. For any non-dense set $A \subset [0,1)$ such that $A \cap \mathbb{Q}$ is invariant under $\times b$ operation, we prove the finiteness…

Let k>1 be an integer and let p be a prime. We show that if $p^a\le k<2p^a$ or $k=p^aq+1$ (with 2q<p) for some a=1,2,..., then the set {\binom{n}{k}: n=0,1,2,...} is dense in the ring Z_p of p-adic integers, i.e., it contains a complete…

Let $\mathcal{A}$ denote a finite set of arithmetic progressions of positive integers and let $s \geq 2$ be an integer. If the cardinality of $\mathcal{A}$ is at least 2 and $U$ is the union formed by taking certain arithmetic progressions…

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial.…

I present Franz Lemmermeyer's proof that if p is a prime congruent to 9 mod 16 then the class number of Q(p^(1/4)) is congruent to 2 mod 4.

A composite number $n$ is called Lehmer when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. In 1932, D.~H.~Lehmer conjectured that there are no composite Lehmer numbers and showed that Lehmer numbers must be odd and…

A single parameter cubic composite test for odd positive integers is given which relies on the discriminant always being a square integer. This test has no known counterexample despite extensive verifications. As well as a comparison with…

The multplicative order of an integer g modulo a prime p, with p coprime to g, is defined to be the smallest positive integer k such that g^k is congruent to 1 modulo p. For fixed integers g and d the distribution of this order over residue…

We consider the problem of determining whether a given prime p is a congruent number. We present an easily computed criterion that allows us to conclude that certain primes for which congruency was previously undecided, are in fact not…

In 1952, Perron showed that quadratic residues in a field of prime order satisfy certain ad- ditive properties. This result has been generalized in different directions, and our contribution is to provide a further generalization concerning…

An \emph{indexing} of a finite set $S$ is a bijection $D : \{1,...,|S|\} \rightarrow S$. We present an indexing for the set of quadratic residues modulo $N$ that is decodable in polynomial time on the size of $N$, given the factorization of…

Let $b(n)$ denote the number of cubic partition pairs of $n$. We give affirmative answer to a conjecture of Lin, namely, we prove that $$b(49n+37)\equiv 0 \pmod{49}.$$ We also prove two congruences modulo $256$ satisfied by…

We construct a countable family of multi-dimensional continued fraction algorithms, built out of five specific multidimensional continued fractions, and find a wide class of cubic irrational real numbers a so that either (a, a^2) or (a,…

We say that k is a P-integer if the first phi(k) primes coprime to k form a reduced residue system modulo k. In 1980 Pomerance proved the finiteness of the set of P-integers and conjectured that 30 is the largest P-integer. We prove the…

Let \(d_k(p)\) denote the natural density of positive integers whose \(k\)-th smallest prime divisor is \(p\). Erd\H{o}s asked whether, for each fixed \(k\), the sequence \(p\mapsto d_k(p)\) is unimodal as \(p\) ranges over the primes.…

Suppose that an infinite set $A$ occupies at most $\frac{1}{2}(p+1)$ residue classes modulo $p$, for every sufficiently large prime $p$. The squares, or more generally the integer values of any quadratic, are an example of such a set. By…