with xi ∈ Fq, i.e., as a sum of kth powers of elements of Fq. We can then define the Waring function g(k, q) as the maximal number of summands needed to express all elements of Fq as sums of kth powers. We note that, by an easy argument, we have g(k, q) = g(k, q), where k = gcd(k, q − 1). Hence, we will assume from now on that k divides q − 1. Several authors have established bounds on the valu...

coming from the cokernels of the rst column. These are cyclic (pro-cyclic in the limit) and are generated by the image of q t. So, lim A(K t)=NA(K n;t) = ?=< (q t ; L t =K t) > where (q t ; L t =K t) is the norm residue symbol of q t for the extension L t =K t. We write Q t for the image of (q t ; L t =K t) under the isomorphism ? ! Z p induced by sending to 1. Note that although Q t is not can...

There are many good references for this material including [EKM], [L], [Pf] and [S]. 1 Quadratic forms Let k be a field with char k = 2. Definition 1.1. A quadratic form q : V → k on a finite-dimensional vector space V over k is a map satisfying: 1. q(λv) = λ 2 q(v) for v ∈ V , λ ∈ k. 2. The map b q : V × V → k, defined by b q (v, w) = 1 2 [q(v + w) − q(v) − q(w)] is bilinear. We denote a quadr...

In 1961, Rankin determined the asymptotic behavior of number Sk,q(x) positive integers n?x for which a given prime q does not divide ?k(n), k-th divisor sum function. By computing associated Euler-Kronecker constant ?k,q, depends on arithmetic certain subfields Q(?q), we obtain second order term in expansion Sk,q(x). Using method developed by Ford, Luca and Moree (2014), determine pairs (k,q) w...

A simple q-analogue of the sum of cubes is given. This answers a question posed in this journal by Garrett and Hummel. The sum of cubes and its q-analogues It is well-known that the first n consecutive cubes can be summed in closed form as n ∑ k=1 k = ( n + 1 2 )2 . Recently, Garrett and Hummel discovered the following q-analogue of this result: n ∑ k=1 qk−1 (1− q)(2− qk−1 − q) (1− q)2(1− q2) =...

f g overlay q q q q q q q q q q n n O n n k k k O n n 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 Introduction and background

: H F R Q V LG H U W ZR S U R E OH P V R Q G LV V H F W LR Q V R I S R O\J R Q V ,Q W K H p U V W S U R E OH P ZH F R Q V LG H U W K H P LQ LP X P Q X P E H U R I S LH F H V LQ G LV V H F W LQ J ZLW K U H F W LOLQ H D U J OD V V F X W V D Q P Q d P Q U H F W D Q J OH LQ W R D X Q LW V TX D U H $ U H F W D Q J OH LV F D OOH G V H P L LQ W H J H U LI H LW K H U LW V E D V H R U LW V K H LJ K W LV...

A pair of sequences (αn(a, k, q),βn(a, k, q)) such that α0(a, k, q) = 1 and βn(a, k, q) = n ∑ j=0 (k/a; q)n−j(k; q)n+j (q; q)n−j(aq; q)n+j αj(a, k, q) is termed a WP-Bailey Pair. Upon setting k = 0 in such a pair we obtain a Bailey pair. In the present paper we consider the problem of “lifting” a Bailey pair to a WPBailey pair, and use some of the new WP-Bailey pairs found in this way to derive...