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.

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 ...

Mainly for didactic purposes. I wanted to understand some asymptomatically good integer factorization algorithms and the quadratic sieve is far simpler than the faster alternative, the general number ...

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 ...

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 ...