Results 11 to 20 of about 288 (212)
One missing value problem in Latin square design of any order: Exact analysis of variance
Cogent Engineering, 2017 This research proposes a simplified exact approach based on the general linear model for solving the K × K Latin square design (LSD) with one replicate and one missing value, given the lack of ready-made mathematical formulas for the sub-variance.
Kittiwat Sirikasemsuk +1 more
doaj +1 more source
Ciência e Agrotecnologia, 2003 Quando o modelo estatístico não é ortogonal ou nos casos de desbalanceamento, existem diferentes critérios para a formulação de hipóteses que geram diferentes valores para as somas de quadrados.
Paulo César Lima +3 more
doaj +1 more source
Mathematical Attack of RSA by Extending the Sum of Squares of Primes to Factorize a Semi-Prime
Mathematical and Computational Applications, 2020 The security of RSA relies on the computationally challenging factorization of RSA modulus N=p1 p2 with N being a large semi-prime consisting of two primes p1and p2, for the generation of RSA keys in commonly adopted cryptosystems. The property of p1 and
Anthony Overmars +1 more
doaj +1 more source
Proceedings of the American Mathematical Society, 1957 We make use of an elegant method of Professor H. Davenport [l] in the Geometry of Numbers. Without loss of generality we will prove Theorem 1 only when m is square free. (In the following m will be assumed to be square free.) In §1 we shall prove Theorem 1 when m = 3 (mod 8).
openaire +2 more sources
Univariate rational sums of squares
Revista de la Unión Matemática Argentina, 2022 Dados los polinomios racionales univariados f y g tales que gcd(f, g) y f / gcd(f, g) son relativamente primos, mostramos que g es no negativo en todas las raíces reales de f si y solo si g es una suma de cuadrados de polinomios racionales módulo f. Completamos nuestro estudio exhibiendo un algoritmo que produce un certificado de que un polinomio g es ...
Teresa Krick +2 more
openaire +4 more sources
Recursive determination of the enumerator for sums of three squares
International Journal of Mathematics and Mathematical Sciences, 2000 For each nonnegative integer n, r3(n) denotes the number of representations of n by sums of three squares. Here presented is a two-step recursive scheme for computing r3(n), n≥0.
John A. Ewell
doaj +1 more source
On large deviations for random sums of the squares of weighted Gaussian random variables
Lietuvos Matematikos Rinkinys, 2015 The paper considers normal approximation to the distribution of random sums of the squares of independent weighted Gaussian random variables (r.vs.) taking into consideration large deviations in the Cramér zone.
Aurelija Kasparavičiūtė +1 more
doaj +1 more source
Decomposition of the mean absolute error (MAE) into systematic and unsystematic components.
PLoS ONE, 2023 When evaluating the performance of quantitative models, dimensioned errors often are characterized by sums-of-squares measures such as the mean squared error (MSE) or its square root, the root mean squared error (RMSE).
Scott M Robeson, Cort J Willmott
doaj +1 more source
Sums of Squares and Sums of Triangular Numbers [PDF]
gmj, 2006 Abstract Motivated by two results of Ramanujan, we give a family of 15 results and 4 related ones. Several have interesting interpretations in terms of the number of representations of an integer by a quadratic form , where λ1 + . . . + λ𝑚 = 2, 4 or 8.
Cooper, Shaun, Hirschhorn, Michael
openaire +2 more sources
An upper bound on binomial coefficients in the de Moivre – Laplace form
Журнал Белорусского государственного университета: Математика, информатика, 2022 We provide an upper bound on binomial coefficients that holds over the entire parameter range an whose form repeats the form of the de Moivre – Laplace approximation of the symmetric binomial distribution.
Sergey V. Agievich
doaj +1 more source