Quadratic residues and non-residues for infinitely many Piatetski-Shapiro primes

In this paper, we prove a quantitative version of the statement that every nonempty finite subset of N+ is a set of quadratic residues for infinitely many primes of the form [nc] with 1 ≤ c ≤243/205. Correspondingly, we can obtain a similar result for the case of quadratic non-residues under reasonable assumptions. These results generalize the previous ones obtained by Wright in certain aspects.     

Quartic residues and binary quadratic forms

Let be a prime, m∈Z and . In this paper we obtain a general criterion for m to be a quartic residue in terms of appropriate binary quadratic forms. Let d>1 be a squarefree integer such that , where is the Legendre symbol, and let ε_d be the fundamental unit of the quadratic field . Since 1942 many mathematicians tried to characterize those primes p so that ε_d is a quadratic or quartic residue . In this paper we will completely solve these open problems by determining the value of , where p is an odd prime, and . As an application we also obtain a general criterion for , where {u_n(a,b)} is the Lucas sequence defined by and .     

Cubic residues and binary quadratic forms

Let p>3 be a prime, u,v,d∈Z, gcd(u,v)=1, p?u²−dv² and , where is the Legendre symbol. In the paper we mainly determine the value of by expressing p in terms of appropriate binary quadratic forms. As applications, for we obtain a general criterion for and a criterion for εd to be a cubic residue of p, where εd is the fundamental unit of the quadratic field . We also give a general criterion for , where {Un} is the Lucas sequence defined by U₀=0, U₁=1 and Un+1=PUn−QUn−1 (n?1). Furthermore, we establish a general result to illustrate the connections between cubic congruences and binary quadratic forms.     

On runs of consecutive quadratic residues and quadratic nonresidues

Based on results of Weil and of Burgess, we have obtained a boundK(l) such that all primesp K(l) have a sequence of at leastl consecutive quadratic residues and a sequence of at leastl consecutive nonresidues in the interval [1,p – 1]. The bound forl=9 being 414463, we have computed, for primes less than 420000, the lengths of the longest sequences of consecutive residues and of nonresidues. We present these data and make some observations concerning them. One of the observations is that there is an observed difference in the length of the maximal sequence between primes congruent to 1 (mod 4) and primes congruent to 3 (mod 4).     

Picard sequences with every orbit containing infinitely many perfect n-powers

Text

Finding a function which generates a sequence via iteration whose values at one or many points in its domain satisfy certain prescribed properties, i.e., finding a function such that the Picard orbit(s) of one or many points in its domain which possess some given properties, is an interesting problem. Given any positive integer n greater than one, we construct in this paper families of functions on the natural numbers such that the sequence of the iterations of each of these functions at any positive integer s contains infinitely many perfect n-powers. In terms of Picard sequences, this amounts to constructing a function whose Picard orbit at every point in its domain contains infinitely many perfect n-powers.

Video

For a video summary of this paper, please visit http://www.youtube.com/watch?v=wJqaXyB2pdo.     

There are infinitely many Perrin pseudoprimes

This paper proves the existence of infinitely many Perrin pseudoprimes, as conjectured by Adams and Shanks in 1982. The theorem proven covers a general class of pseudoprimes based on recurrence sequences. The result uses ingredients of the proof of the infinitude of Carmichael numbers, along with zero-density estimates for Hecke L-functions.     

On the quadratic character of quadratic units

Let be a prime. Let a,b∈Z with p?a(a²+b²). In the paper we mainly determine by assuming p=c²+d² or p=Ax²+2Bxy+Cy² with AC−B²=a²+b². As an application we obtain simple criteria for εD to be a quadratic residue , where D>1 is a squarefree integer such that D is a quadratic residue of p, εD is the fundamental unit of the quadratic field with negative norm. We also establish the congruences for and obtain a general criterion for p|U(p−1)/4, where {Un} is the Lucas sequence defined by U₀=0, U₁=1 and Un+1=bUn+k²Un−1(n?1).     

The distribution of quadratic residues and nonresidues in arithmetic progressions

We prove some results concerning the distribution of quadratic residues and nonresidues in arithmetic progressions in the setting \( {{\mathbb{F}}_p}={{\mathbb{Z}} \left/ {{p\mathbb{Z}}} \right.} \) , where p is a large prime.     

Reduction of matrices over orders of imaginary quadratic fields

A special decomposition (called the near standard form) of (1,2)-matrices over a ring is introduced and a method for a reduction of such matrices is explained. This can be applied for a detection of elementary second order matrices among invertible second order matrices. The tool is used in detail over orders of imaginary quadratic fields, where an algorithm, a number of properties and examples are presented.     

Simple arguments on consecutive power residues

By some extremely simple arguments, we point out the following:

(i)

If n is the least positive kth power non-residue modulo a positive integer m, then the greatest number of consecutive kth power residues mod m is smaller than m/n.

(ii)

Let OK be the ring of algebraic integers in a quadratic field with d∈{−1,−2,−3,−7,−11}. Then, for any irreducible π∈OK and positive integer k not relatively prime to , there exists a kth power non-residue ω∈OK modulo π such that .

     

Quartic, octic residues and Lucas sequences

Let be a prime and a,b∈Z with a²+b²≠p. Suppose p=x²+(a²+b²)y² for some integers x and y. In the paper we develop the calculation technique of quartic Jacobi symbols and use it to determine . As applications we obtain the congruences for modulo p and the criteria for (if ), where {Un} is the Lucas sequence given by U₀=0, U₁=1 and Un+1=bUn+k²Un−1(n?1). We also pose many conjectures concerning , or .     

Structure of digraphs associated with quadratic congruences with composite moduli

We assign to each positive integer n a digraph G(n) whose set of vertices is H={0,1,…,n-1} and for which there exists a directed edge from a∈H to b∈H if . Associated with G(n) are two disjoint subdigraphs: G₁(n) and G₂(n) whose union is G(n). The vertices of G₁(n) correspond to those residues which are relatively prime to n. The structure of G₁(n) is well understood. In this paper, we investigate in detail the structure of G₂(n).     

Separable free quadratic algebras over quadratic integers

The aim of the paper is to determine all free separable quadratic algebras over the rings of integers of quadratic fields in terms of the properties of the fundamental unit in the real case. The paper corrects some earlier published results on the subject.     

Some curious congruences modulo primes

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence:

     

On admissible constellations of consecutive primes

Admissible constellations of primes are patterns which, like the twin primes, no simple divisibility relation would prevent from being repeated indefinitely in the series of primes. All admissible constellations, formed ofconsecutive primes, beginning with a prime <1000, are established, and some properties of such constellations in general are conjectured.Dedicated to Peter Naur on the occasion of his 60th birthday     

Risk-neutral valuation with infinitely many trading dates

The first Fundamental Theorem of Asset Pricing establishes the equivalence between the absence of arbitrage in financial markets and the existence of Equivalent Martingale Measures, if appropriate conditions hold. Since the theorem may fail when dealing with infinitely many trading dates, this paper draws on the A.A. Lyapunov Theorem in order to retrieve the equivalence for complete markets such that the Sharpe Ratio is adequately bounded.     

On certain exponential sums over primes

Let f(x) be a real valued polynomial in x of degree k?4 with leading coefficient α. In this paper, we prove a non-trivial upper bound for the quantity