Let f # Z[x] with degree k and let p be a prime. By a complete trigonometric sum we mean a sum of the form S(q, f )= q x=1 e q ( f (x)), where q is a positive integer and e q (:)=exp(2?if (x)Γq). Professor Chalk made a conjecture on the upper bound of S(q, f ) when q is a prime power. We prove Chalk
On a Conjecture of Chowlaet al.
β Scribed by B. Sury
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 147 KB
- Volume
- 72
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
β¦ Synopsis
We prove some congruences for the numbers
In particular, we show that the numbers a p = k ( p k ) 2 ( p+k k ) 2 are congruent to 5 modulo p 3 for any prime p 5, thereby proving a conjecture of Chowla et al. (J. Number Theory 12 (1980), 188 190).
1998 Academic Press
In particular, the conjecture mentioned earlier is true.
We make some elementary observations which are used in the proof.
π SIMILAR VOLUMES
Dirac proved in 1952 that every 2-connected graph of order n and minimum degree k admits a cycle of length at least minfn; 2kg: As a possible improvement, Woodall conjectured in 1975 that if a 2-connected graph of order n has at least n 2 ΓΎ k vertices of degree at least k; then it has a cycle of len
Suppose that β s 1, 2, . . . , ab for some non-negative integers a and b. Denote Ε½ . by P a, b the set of unordered partitions of β into a parts of cardinality b. In this Ε½ . paper we study the decomposition of the permutation module C P a, b where C is Ε½ . the field of complex numbers. In particula
In this paper we prove a particular case of a conjecture of Ash that states the existence of Galois representations associated to Hecke eigenclasses in cohomology.
A graph G is k-critical if it has chromatic number k but every proper subgraph of G has a (k&1)-coloring. We prove the following result. If G is a k-critical graph of order n>k 3, then G contains fewer than n&3kΓ5+2 complete subgraphs of order k&1.