1802 Submissions

[3] viXra:1802.0294 [pdf] submitted on 2018-02-21 10:54:53

Solution of a High-School Algebra Problem to Illustrate the Use of Elementary Geometric (Clifford) Algebra

Authors: James A. Smith
Comments: 5 Pages.

This document is the first in what is intended to be a collection of solutions of high-school-level problems via Geometric Algebra (GA). GA is very much "overpowered" for such problems, but students at that level who plan to go into more-advanced math and science courses will benefit from seeing how to "translate" basic problems into GA terms, and to then solve them using GA identities and common techniques.
Category: Algebra

[2] viXra:1802.0096 [pdf] submitted on 2018-02-08 06:48:35

Solution to the Problem Pmo33.5. Problema Del Duelo Matemático 08 (Olomouc – Chorzow Graz).

Authors: Jesús Álvarez Lobo
Comments: 3 Pages. Spanish.

Solution to the problem PMO33.5. Problema del Duelo Matemático 08 (Olomouc – Chorzow - Graz). Let a, b, c in ℝ. Prove that V = 4(a² + b² + c² ) - (a + b)² - (b + c)² - (c + a)² >= 0, and determine all values of a, b, c for which V = 0.
Category: Algebra

[1] viXra:1802.0022 [pdf] submitted on 2018-02-02 16:54:13

Discarding Algorithm for Rational Roots of Integer Polynomials (DARRIP).

Authors: Jesús Álvarez Lobo
Comments: 20 Pages.

The algorithm presented here is to be applied to polynomials whose independent term has many divisors. This type of polynomials can be hostile to the search for their integer roots, either because they do not have them, or because the first tests performed have not been fortunate. This algorithm was first published in Revista Escolar de la Olimpíada Iberoamericana de Matemática, Number 19 (July - August 2005). ISSN – 1698-277X, in Spanish, with the title ALGORITMO DE DESCARTE DE RAÍCES ENTERAS DE POLINOMIOS. When making this English translation 12 years later, some erratum has been corrected and when observing from the perspective of time that some passages were somewhat obscure, they have been rewritten trying to make them more intelligible. The algorithm is based on three properties of divisibility of integer polynomials, which, astutely implemented, define a very compact systematic that can simplify significantly the exhaustive search of integer roots and rational roots. Although there are many other methods for discarding roots, for example, those based on bounding rules, which sometimes drastically reduce the search interval, for the sake of simplicity, they will not be considered here. The study presented here could be useful to almost all the young people of the planet, since at some stage of their academic training they will have to solve polynomial equations with integer coefficients, looking for rational solutions, integer or fractional. The author thinks that DARRIP's algorithm should be incorporated into the curricula of all the elementary study centers over the world.
Category: Algebra