We discuss to what extent Euclid’s elementary proof of the infinitude of primes can be modified so as to show infinitude of primes in arithmetic progressions (Dirichlet’s theorem). Murty had shown earlier that such proofs can exist if and only if the residue class (mod k ) has order 1 or 2. After reviewing this work, we consider generalizations of this question to algebraic number fields.

The generalized Euler number En|k counts the number of permutations of {1, 2, . . . , n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k = 2. In this paper, we study divisibility properties of a q-analog of En|k. In particular, we generalize two theorems of Andrews and Gessel [3] about factors of the q-tangent numbers.

We suggest a method to construct a homomorphic encryption scheme for approximate arithmetic. It supports an approximate addition and multiplication of encrypted messages, together with a new rescaling procedure for managing the magnitude of plaintext. This procedure truncates a ciphertext into a smaller modulus, which leads to rounding of plaintext. The main idea is to add a noise following sig...

Guodong Liu Department of Mathematics, Huizhou University, Huizhou, Guangdong 516015, China Correspondence should be addressed to Guodong Liu, [email protected] Received 18 June 2009; Accepted 12 August 2009 Recommended by Leonid Berezansky An explicit formula, the generalized Genocchi numbers, was established and some identities and congruences involving the Genocchi numbers, the Bernoul...

Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. They rely on graphs that jointly represent each data point. The problem of how to best formulate the graph representation remains an open research topic. In this paper, we introduce a type-2 fuzzy arithmetic to characterize the edge weights of a form...

We construct the transreal numbers and arithmetic from subsets of hyperreal numbers. In possession this construction, we propose a contextual interpretation arithmetical operations as vector transformations.

Numbers are the lifeblood of statistics, and computational statistics relies heavily on how numbers are represented and manipulated on a computer. Computer hardware and statistical software handle numbers well, and the methodology of computer arithmetic is rarely a concern. However, whenever we push hardware and software to their limits with difficult problems, we can see signs of the mechanics...

Let the integers 1, . . . , n be assigned colors. Szemerédi’s theorem implies that if there is a dense color class then there is an arithmetic progression of length three in that color. We study the conditions on the color classes forcing totally multicolored arithmetic progressions of length 3. Let f(n) be the smallest integer k such that there is a coloring of {1, . . . , n} without totally m...