<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Modular-Arithmetic on Karpoke - Just Another Blog</title><link>http://karpoke.ignaciocano.com/tags/modular-arithmetic/</link><description>Recent content in Modular-Arithmetic on Karpoke - Just Another Blog</description><generator>Hugo -- 0.167.0</generator><language>es</language><lastBuildDate>Wed, 16 May 2012 23:58:00 +0100</lastBuildDate><atom:link href="http://karpoke.ignaciocano.com/tags/modular-arithmetic/index.xml" rel="self" type="application/rss+xml"/><item><title>Basics of Computational Number Theory</title><link>http://karpoke.ignaciocano.com/2012/05/16/basics-of-computational-number-theory/</link><pubDate>Wed, 16 May 2012 23:58:00 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2012/05/16/basics-of-computational-number-theory/</guid><description>&lt;blockquote&gt;
&lt;p&gt;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.&lt;/p&gt;
&lt;/blockquote&gt;</description></item></channel></rss>