Three algorithm implementations for square root computation are considered in this paper. Newton-Raphson's, iterative, and binary search algorithm implementations are completely designed, verified and compared. The algorithms, entire system-on-chip realisations and their functioning are described.

A ring R for which x = 0 for all x e R is called a zerosquare ring. Zero-square rings are easily seen to be locally nilpotent. This leads to two problems: (1) constructing finitely generated zero-square rings with large index of nilpotence, and (2) investigating the structure of finitely generated zerosquare rings with given index of nilpotence. For the first problem we construct a class of zer...

Identify the domain and range of each. Then sketch the graph.

A permutation is square-free if it does not contain two consecutive factors of length more than one that coincide in the reduced form (as patterns). We prove that the number of square-free permutations of length n is nn(1−εn) where εn → 0 when n → ∞. A permutation of length n is crucial with respect to squares if it avoids squares but any extension of it to the right, to a permutation of length...

Graph products are characterized by the existence of non-trivial equivalence relations on the edge set of a graph that satisfy a so-called square property. We investigate here a generalization, termed RSP-relations. The class of graphs with non-trivial RSP-relations in particular includes graph bundles. Furthermore, RSP-relations are intimately related with covering graph constructions. For K2,...

The algorithm of Tonelli and Shanks for computing square roots modulo a prime number is the most used, and probably the fastest among the known algorithms when averaged over all prime numbers. However, for some particular prime numbers, there are other algorithms which are considerably faster. In this paper we compare the algorithm of Tonelli and Shanks with an algorithm based in quadratic fiel...

We show that the Lusin area function and essentially all of its realvariable generalizations are pointwise dominated by an “intrinsic” square function, and that this latter function is, for all practical purposes, no larger than a “generic” square function. 0. Introduction. The Lusin area (or “square”) function is a familiar object. If f : R 7→ R is such that u(x, y) ≡ Py ∗ f(x), the Poisson in...

In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic numbers, their expansion properties as well as their connectivity and Hamiltonicity. The results obtained are compared with other models of random graphs and seve...

Let A be a matrix over the integers, and let p be a positive integer. A submatrix B of A is zero-sum mod p if the sum of each row of B and the sum of each column of B is a multiple of p. Let M(p, k) denote the least integer m for which every square matrix of order at least m has a square submatrix of order k which is zero-sum mod p. In this paper we supply upper and lower bounds for M(p, k). In...

The information inequality has been shown to be an effective tool for providing lower bounds for the minimax risk. Bounds based on the chisquare distance can sometimes offer a considerable improvement especially when applied iteratively. This paper compares these two methods in four examples including the bounded normal mean problem as well as obervations from a Poisson distribution.