Problems with PrimesReportar como inadecuado




Problems with Primes - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.



Australian Mathematics Teacher, v61 n3 p2-5 2005

This article discusses prime numbers, defined as integers greater than 1 that are divisible only by only themselves and the number 1. A positive integer greater than 1 that is not a prime is called composite. The number 1 itself is considered neither prime nor composite. As the name suggests, prime numbers are one of the most basic but important propositions in all of mathematics. Primes, once associated exclusively with pure mathematics, have recently found an unexpected application in the areas of national security, and in particular public-key cryptography. This uses the principle that it is very difficult to find the factors of a given product of two very large primes. The authors focus on the historical facts and the contributions of several mathematicians in distinguishing the most intriguing aspects of prime numbers.

Descriptors: National Security, Numbers, Mathematics Instruction, Technology, Mathematics, Professional Personnel, Computation

Australian Association of Mathematics Teachers (AAMT). GPO Box 1729, Adelaide 5001, South Australia. Tel: +61-8-8363-0288; Fax: +61-8-8362-9288; e-mail: office[at]aamt.edu.au; Web site: http://www.aamt.edu.au





Autor: Melrose, Tim; Scott, Paul

Fuente: https://eric.ed.gov/?q=a&ft=on&ff1=dtySince_1992&pg=4821&id=EJ922149







Documentos relacionados