A bound for the first k-1 consecutive k-th power non-residues (mod p)
A graph is called weakly perfect if its chromatic number equals its clique number. In this note a new class of weakly perfect graphs is presented and an explicit formula for the chromatic number of such graphs is given.
In this paper, we establish several explicit evaluations, reciprocity theorems and integral representations for a continued fraction of order twelve which are analogues to Rogers-Ramanujan’s continued fraction and Ramanujan’s cubic continued fraction.