http://karpoke.ignaciocano.com/tags/number-theory/Recent content in Number-Theory on Karpoke - Just Another BlogHugo -- 0.167.0esMon, 21 Aug 2023 00:26:50 +0100http://karpoke.ignaciocano.com/2023/08/21/the-lawlessness-of-large-numbers/Mon, 21 Aug 2023 00:26:50 +0100http://karpoke.ignaciocano.com/2023/08/21/the-lawlessness-of-large-numbers/<blockquote> <p>Mathematicians can often figure out what happens as quantities grow infinitely large. What about when they are just a little big?</p> </blockquote> <p>» Leila Sloman | <a href="https://www.quantamagazine.org/mathematical-tricks-for-taming-the-middle-distance-20230707/">quantamagazine.org</a></p>http://karpoke.ignaciocano.com/2020/09/04/descomposicion-en-factores-primos-de-un-numero/Fri, 04 Sep 2020 08:12:13 +0100http://karpoke.ignaciocano.com/2020/09/04/descomposicion-en-factores-primos-de-un-numero/<blockquote> <p>Vamos a ver en qué consiste la descomposición en factores primos, o descomposición factorial, de un número, para qué se utiliza y, lo más importante, cómo se hace. Todo explicado paso a paso y con …</p> </blockquote> <p>» Amadeo Artacho | <a href="https://matematicascercanas.com/2020/09/03/descomposicion-en-factores-primos/">matematicascercanas.com</a></p>http://karpoke.ignaciocano.com/2020/02/12/conjetura-de-mertens-una-fabulosa-contradiccion-matematica/Wed, 12 Feb 2020 00:10:42 +0100http://karpoke.ignaciocano.com/2020/02/12/conjetura-de-mertens-una-fabulosa-contradiccion-matematica/<blockquote> <p>Algunos problemas matemáticos pueden ser resueltos en un tiempo razonable. Otros… demandan décadas enteras, y a pesar del resultado final, uno nunca logra despejar la sensación de que hay algo mal en todo el proceso. Uno de los ejemplos más contundentes es la llamada Conjetura…</p> </blockquote> <p>» neoteo.com | <a href="https://www.neoteo.com/conjetura-de-mertens/">neoteo.com</a></p>http://karpoke.ignaciocano.com/2012/05/16/basics-of-computational-number-theory/Wed, 16 May 2012 23:58:00 +0100http://karpoke.ignaciocano.com/2012/05/16/basics-of-computational-number-theory/<blockquote> <p>This document is a gentle introduction to computational number theory. The plan of the paper is to first give a quick overview of arithmetic in the modular integers. Throughout, we will emphasize computation and practical results rather than delving into the why. Simple programs, generally in JavaScript, are available for all of the algorithms mentioned. At the end of the paper we will introduce the Gaussian Integers and Galois Fields and compare them to the modular integers. Companion papers will examine number theory from a more advanced perspective.</p> </blockquote>