A sharper bound for the least pair of consecutive k-th power non-residues of non-principal characters (mod p) of order k > 3
Given A and B integers relatively prime, we prove that almost all integers n in an interval of the form [N, N+H], where N exp(1/3+e) ≤ H ≤ N can be written as a sum Ap1 + Bp2 = n, with p1 and p2 primes and e an arbitrary positive constant. This generalizes the results of Perelli et al. (1985) established in the classical case A=B=1 (Goldbach's problem).
For every simple finite-dimensional complex Lie algebra, I give a simple construction of all (except for the Pfaffian) basic polynomials invariant under the Weyl group. The answer is given in terms of the two basic polynomials of smallest degree.