<--- Back to Details
First PageDocument Content
Combinatorics / Arithmetic / Mathematical notation / Summation / Euclidean algorithm / Factorial / Collatz conjecture / Iterated function / Characterizations of the exponential function / Mathematics / Number theory / Integer sequences
Date: 2005-12-13 11:54:44
Combinatorics
Arithmetic
Mathematical notation
Summation
Euclidean algorithm
Factorial
Collatz conjecture
Iterated function
Characterizations of the exponential function
Mathematics
Number theory
Integer sequences

Add to Reading List

Source URL: www.afjarvis.staff.shef.ac.uk

Download Document from Source Website

File Size: 64,57 KB

Share Document on Facebook

Similar Documents

An algorithm for realizing Euclidean distance matrices Jorge Alencar 1 Instituto Federal de Educa¸c˜ ao, Ciˆencia e Tecnologia do Sul de Minas Gerais, Inconfidentes, MG, Brazil

DocID: 1uZU2 - View Document

A COMPLETE WORST-CASE ANALYSIS OF KANNAN’S SHORTEST LATTICE VECTOR ALGORITHM ´† GUILLAUME HANROT∗ AND DAMIEN STEHLE Abstract. Computing a shortest nonzero vector of a given euclidean lattice and computing a closes

DocID: 1uAnv - View Document

THE EUCLIDEAN ALGORITHM IN ALGEBRAIC NUMBER FIELDS FRANZ LEMMERMEYER Abstract. This article, which is an update of a version published 1995 in Expo. Math., intends to survey what is known about Euclidean number fields;

DocID: 1uads - View Document

Notes on continued fractions 1. Chapter 49: The Topsy-turvy world of continued fractions First, let’s go back, way back, to the Euclidean algorithm. Let’s say for 23 and 5. If we run this through we get 23 = 4 ∗ 5

DocID: 1tH6y - View Document

Research Article Climbing the Steiner Tree—Sources of Active Information in a Genetic Algorithm for Solving the Euclidean Steiner Tree Problem Winston Ewert,1* William Dembski,2 Robert J. Marks II1

DocID: 1tff1 - View Document