Abstract: In this correspondence, the constructions and enumerations of all bent functions represented by a polynomial form of f(x)=/spl Sigma//sub i=1//sup n/2-1/c/sub i/Tr(x/sup 1+2(i)/)+c/sub ...
Abstract: In this correspondence, we construct some new quadratic bent functions in polynomial forms by using the theory of quadratic forms over finite fields. The results improve some previous work.
A criteria to identify precisely the primes of the form x^2 + ny^2 is described in a book by Cox. This repository computes that criteria. The main difficult thing this program must do is compute the ...
This is a preview. Log in through your library . Abstract Using Newton-type corrections, a simultaneous improvement of a complete set of approximate factors of arbitrary degree of a polynomial is ...
We investigate here the representability of integers as sums of triangular numbers, where the n-th triangular number is given by Tn = n(n+1)/2. In particular, we show ...
If \((x \pm h)\) is a factor of a polynomial, then the remainder will be zero. Conversely, if the remainder is zero, then \((x \pm h)\) is a factor. Often ...
A mathematician at Carnegie Mellon University has developed an easier way to solve quadratic equations. The mathematician hopes this method will help students avoid memorizing obtuse formulas. His ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results