On Cyclotomic Numbers of Order Sixteen

1954 ◽  
Vol 6 ◽  
pp. 449-454 ◽  
Author(s):  
Emma Lehmer
Keyword(s):  
Linear Combination ◽  
Primitive Root ◽  
Number Of Solutions ◽  
Integer Coefficients ◽  
Cyclotomic Numbers ◽  
Image Position ◽  
Mod P

It has been shown by Dickson (1) that if (i, j)8 is the number of solutions of (mod p),then 64(i,j)8 is expressible for each i,j, as a linear combination with integer coefficients of p, x, y, a, and b where,anda ≡ b ≡ 1 (mod 4),while the sign of y and b depends on the choice of the primitive root g. There are actually four sets of such formulas depending on whether p is of the form 16n + 1 or 16n + 9 and whether 2 is a quartic residue or not.

SYSTEMS OF CONGRUENCES WITH PRODUCTS OF VARIABLES FROM SHORT INTERVALS

2015 ◽  
Vol 93 (3) ◽  
pp. 364-371
Author(s):  
IGOR E. SHPARLINSKI
Keyword(s):  
Upper Bound ◽  
Number Of Solutions ◽  
Short Intervals ◽  
Image Position ◽  
Mod P

We obtain an upper bound for the number of solutions to the system of $m$ congruences of the type $$\begin{eqnarray}\displaystyle \mathop{\prod }_{i=1}^{{\it\nu}}(x_{i}+s_{i})\equiv {\it\lambda}_{j}~(\text{mod }p)\quad j=1,\ldots ,m, & & \displaystyle \nonumber\end{eqnarray}$$ modulo a prime $p$, with variables $1\leq x_{i}\leq h$, $i=1,\ldots ,{\it\nu}$ and arbitrary integers $s_{j},{\it\lambda}_{j}$, $j=1,\ldots ,m$, for a parameter $h$ significantly smaller than $p$. We also mention some applications of this bound.

On rational primes p congruent to 1 (mod 3 or 5)

1969 ◽  
Vol 66 (1) ◽  
pp. 61-70 ◽  
Author(s):  
A. R. Rajwade
Keyword(s):  
Primitive Root ◽  
Number Of Solutions ◽  
Image Position

Let p ≡ 1 (mod 3) or ≡ 1 (mod 5) be a rational prime and g a primitive root mod p. The non-zero residues g, g2,…,gp−1 (mod p) can then be divided into 3 or 5 classes , , , or , , , , respectively, by letting gν ∈ , , (respectively , , , , ) according as ν ≡ 0, 1, 2, (mod 3) (respectively 0, 1, 2, 3, 4 (mod 5)). Problems regarding the distribution of 1, 2, …, p − 1 amongst the 3 (respectively 5) classes are many. In this paper we consider the following problem in some detail (we shall state it here for the case p ≡ 1 (mod 3)). Let α, β, γ be typical members of , , respectively. Let the number of solutions of the congruencesbe

scholarly journals Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime and applications

2016 ◽  
Vol 160 (3) ◽  
pp. 477-494 ◽  
Author(s):  
J. CILLERUELO ◽  
M. Z. GARAEV
Keyword(s):  
Upper Bound ◽  
Absolute Constant ◽  
Primitive Root ◽  
Multiple Roots ◽  
Number Of Solutions ◽  
Residue Classes ◽  
Primitive Root Modulo ◽  
Image Position ◽  
Almost All ◽  
Positive Integers

AbstractIn this paper we obtain new upper bound estimates for the number of solutions of the congruence $$\begin{equation} x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in \mathcal{U}, \end{equation}$$ for certain ranges of H and |${\mathcal U}$|, where ${\mathcal U}$ is a subset of the field of residue classes modulo p having small multiplicative doubling. We then use these estimates to show that the number of solutions of the congruence $$\begin{equation} x^n\equiv \lambda\pmod p; \quad x\in \mathbb{N}, \quad L<x<L+p/n, \end{equation}$$ is at most $p^{\frac{1}{3}-c}$ uniformly over positive integers n, λ and L, for some absolute constant c > 0. This implies, in particular, that if f(x) ∈ $\mathbb{Z}$[x] is a fixed polynomial without multiple roots in $\mathbb{C}$, then the congruence xf(x) ≡ 1 (mod p), x ∈ $\mathbb{N}$, x ⩽ p, has at most $p^{\frac{1}{3}-c}$ solutions as p → ∞, improving some recent results of Kurlberg, Luca and Shparlinski and of Balog, Broughan and Shparlinski. We use our results to show that almost all the residue classes modulo p can be represented in the form xgy (mod p) with positive integers x < p5/8+ϵ and y < p3/8. Here g denotes a primitive root modulo p. We also prove that almost all the residue classes modulo p can be represented in the form xyzgt (mod p) with positive integers x, y, z, t < p1/4+ϵ.

scholarly journals On a Set of Conform-Invariant Equations of the Gravitational Field

1953 ◽  
Vol 10 (1) ◽  
pp. 16-20 ◽  
Author(s):  
H. A. Buchdahl
Keyword(s):  
Gravitational Field ◽  
Linear Combination ◽  
Curvature Tensor ◽  
Wide Class ◽  
Ricci Tensor ◽  
Empty Space ◽  
Image Position ◽  
Derivatives Of

Eddington has considered equations of the gravitational field in empty space which are of the fourth differential order, viz. the sets of equations which express the vanishing of the Hamiltonian derivatives of certain fundamental invariants. The author has shown that a wide class of such equations are satisfied by any solution of the equationswhere Gμν and gμν are the components of the Ricci tensor and the metrical tensor respectively, whilst λ is an arbitrary constant. For a V4 this applies in particular when the invariant referred to above is chosen from the setwhere Bμνσρ is the covariant curvature tensor. K3 has been included since, according to a result due to Lanczos3, its Hamiltonian derivative is a linear combination of and , i.e. of the Hamiltonian derivatives of K1 and K2. In fact

scholarly journals An Orthosymplectic Pieri Rule

10.37236/7387 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Anna Stokke
Keyword(s):  
Linear Combination ◽  
Schur Functions ◽  
Symmetric Polynomial ◽  
Schur Function ◽  
Product Rule ◽  
Integer Coefficients ◽  
Pieri Formula ◽  
Symplectic Characters ◽  
Homogeneous Symmetric Polynomial

The classical Pieri formula gives a combinatorial rule for decomposing the product of a Schur function and a complete homogeneous symmetric polynomial as a linear combination of Schur functions with integer coefficients. We give a Pieri rule for describing the product of an orthosymplectic character and an orthosymplectic character arising from a one-row partition. We establish that the orthosymplectic Pieri rule coincides with Sundaram's Pieri rule for symplectic characters and that orthosymplectic characters and symplectic characters obey the same product rule. 

On Two Conjectures of Chowla

1969 ◽  
Vol 12 (5) ◽  
pp. 545-565 ◽  
Author(s):  
Kenneth S. Williams
Keyword(s):  
Positive Integer ◽  
Image Position ◽  
Mod P

Let p denote a prime and n a positive integer ≥ 2. Let Nn(p) denote the number of polynomials xn + x + a, a = 1, 2,…, p-l, which are irreducible (mod p). Chowla [5] has made the following two conjectures:Conjecture 1. There is a prime p0(n), depending only on n, such that for all primes p ≥ p0(n)

On General Polynomials

1967 ◽  
Vol 10 (4) ◽  
pp. 579-583 ◽  
Author(s):  
Kenneth S. Williams
Keyword(s):  
Finite Field ◽  
Number Of Solutions ◽  
Fixed Integer ◽  
Image Position

Let d denote a fixed integer > 1 and let GF(q) denote the finite field of q = pn elements. We consider q fixed ≥ A(d), where A(d) is a (large) constant depending only on d. Let1where each aiεGF(q). Let nr(r = 2, 3, …, d) denote the number of solutions in GF(q) offor which x1, x2, …, xr are all different.

Permutation endomorphisms and refinement of a theorem of Birkhoff

1960 ◽  
Vol 56 (4) ◽  
pp. 322-328 ◽  
Author(s):  
H. K. Farahat ◽  
L. Mirsky
Keyword(s):  
Abelian Group ◽  
Finite Number ◽  
Linear Combination ◽  
Finite Linear Combination ◽  
Usual Manner ◽  
Restricted Permutation ◽  
Image Position ◽  
Ring Of Endomorphisms ◽  
Finite Linear

Let be a free additive abelian group, and let be a basis of , so that every element of can be expressed in a unique way as a (finite) linear combination with integral coefficients of elements of . We shall be concerned with the ring of endomorphisms of , the sum and product of the endomorphisms φ, χ being defined, in the usual manner, by the equationsA permutation of a set will be called restricted if it moves only a finite number of elements. We call an endomorphism of a permutation endomorphism if it induces a restricted permutation of the basis .

Note on the Linear Symmetric Congruence in n Variables

1953 ◽  
Vol 5 ◽  
pp. 433-438 ◽  
Author(s):  
L. J. Mordell
Keyword(s):  
Integer Coefficients ◽  
Image Position

Let/ = /(x1, x2, … , xn) be a polynomial in n > 2 variables with integer coefficients, and let p be a large prime. Very little appears to be known about estimates for the number N of solutions of the congruence

Sign in / Sign up

Export Citation Format

Share Document