![Algebraic number theory / Field theory / Modular arithmetic / Coprime / Divisor / Fibonacci number / Rational number / Lattice / Euclidean algorithm / Mathematics / Abstract algebra / Number theory Algebraic number theory / Field theory / Modular arithmetic / Coprime / Divisor / Fibonacci number / Rational number / Lattice / Euclidean algorithm / Mathematics / Abstract algebra / Number theory](https://www.pdfsearch.io/img/a2eb93d853d1813f0d2ee9060d1c839e.jpg) Date: 2005-08-27 11:22:17Algebraic number theory Field theory Modular arithmetic Coprime Divisor Fibonacci number Rational number Lattice Euclidean algorithm Mathematics Abstract algebra Number theory | | Baltic Way 2003 Problems and Solutions 1. Let Q+ be the set of positive rational numbers. Find all functions f : Q+ → Q+ which for all x ∈ Q+ fulfil (1) : f ( x1 ) = f (x) (2) : (1 + x1 )f (x) = f (x + 1)Add to Reading ListSource URL: www.georgmohr.dkDownload Document from Source Website File Size: 98,03 KBShare Document on Facebook
|