<--- Back to Details
First PageDocument Content
Modular arithmetic / Algebraic number theory / Quadratic residue / Module theory / Abstract algebra / Mathematics / Number theory
Date: 2013-01-17 11:58:22
Modular arithmetic
Algebraic number theory
Quadratic residue
Module theory
Abstract algebra
Mathematics
Number theory

THE PRIME RESIDUE CLASS OF FINITELY ADDITIVE DISTRIBUTIONS UNIFORM ON THE INTEGERS MICHAEL SPECE AND JOSEPH B. KADANE Abstract. This note shows that the prime residue class of finitely additive uniform distributions on t

Add to Reading List

Source URL: www.stat.cmu.edu

Download Document from Source Website

File Size: 156,08 KB

Share Document on Facebook

Similar Documents

Asymptotics of the minimal distance of quadratic residue codes Jos´ e Felipe Voloch The binary quadratic residue codes are defined as follows.  Given a prime p ≡

Asymptotics of the minimal distance of quadratic residue codes Jos´ e Felipe Voloch The binary quadratic residue codes are defined as follows. Given a prime p ≡

DocID: 1s8Dx - View Document

Double Circulant Quadratic Residue Codes ∗ Tor Helleseth †

Double Circulant Quadratic Residue Codes ∗ Tor Helleseth †

DocID: 1rXXC - View Document

ON A PROPERNESS OF THE HILBERT EIGENVARIETY AT INTEGRAL WEIGHTS: THE CASE OF QUADRATIC RESIDUE FIELDS SHIN HATTORI Abstract. Let p be a rational prime. Let F be a totally real number field such that F is unramified over

ON A PROPERNESS OF THE HILBERT EIGENVARIETY AT INTEGRAL WEIGHTS: THE CASE OF QUADRATIC RESIDUE FIELDS SHIN HATTORI Abstract. Let p be a rational prime. Let F be a totally real number field such that F is unramified over

DocID: 1roCB - View Document

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 1rgbF - View Document

SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of

SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of

DocID: 1rfno - View Document