We present a (random) polynomial-time algorithm to generate a randomGaussian integer with the uniform distribution among those with norm at most N , along with its prime factorization. The method generalizes to finding a random ideal in the ring of integers of a quadratic number field together with its prime ideal factorization. We also discuss the analogous problem for higher degree number fie...

Congruences for Fourier coefficients of integer weight modular forms have been the focal point of a number of investigations. In this note we shall exhibit congruences for Fourier coefficients of a slightly different type. Let f(z) = P∞ n=0 a(n)q n be a holomorphic half integer weight modular form with integer coefficients. If ` is prime, then we shall be interested in congruences of the form

Let p be prime, N be a positive integer prime to p, and k be an integer. Let Pk(t) be the characteristic series for Atkin’s U operator as an endomorphism of p-adic overconvergent modular forms of tame level N and weight k. Motivated by conjectures of Gouvêa and Mazur, we strengthen a congruence in [W] between coefficients of Pk and Pk′ for k ′ p-adically close to k. For p − 1 | 12, N = 1, k = 0...

Let b 2 be an integer and let E/Q be a fixed elliptic curve. In this paper, we estimate the number of primes p x such that the number of points nE(p) on the reduction of E modulo p is a base b prime or pseudoprime. In particular, we improve previously known bounds which applied only to prime values of nE(p).

In this paper we confirm a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p = 2m + 1 is a prime congruent to 3 modulo 4 if and only if Tm = m(m + 1)/2 cannot be expressed as a sum of two odd squares and a triangular number, i.e., p = x+8(y+z) for no odd integers x, y, z. We also sh...

Let S = {q1, . . . , qs} be a finite, non-empty set of distinct prime numbers. For a non-zero integer m, write m = q1 1 . . . q rs s M , where r1, . . . , rs are non-negative integers and M is an integer relatively prime to q1 . . . qs. We define the S-part [m]S of m by [m]S := q r1 1 . . . q rs s . Let (un)n≥0 be a linear recurrence sequence of integers. Under certain necessary conditions, we ...

In this paper we prove a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p = 2m + 1 is a prime congruent to 3 mod 4 if and only if Tm = m(m + 1)/2 cannot be expressed as a sum of two odd squares and a triangular number, i.e., p = x + 8(y + z) for no odd integers x, y, z. We also sho...

Modulo arithmetic modulo a prime integer have many interesting properties. Such properties are found in standard books on number theory. Some properties are especially of interest to the signal processing application. It was observed analogy exists between some of them and that cyclic convolution of two sequences modulo a prime integer of two sequences could be computed in integer domain as can...

We revisit the problem of integer factorization with number-theoretic oracles, including a well-known problem: can we factor an integer $N$ unconditionally, in deterministic polynomial time, given the value of the Euler totient $(\varphi(N)$? We show that this can be done, under certain size conditions on the prime factors of $N$. The key technique is lattice basis reduction using the LLL algor...

In this paper we confirm a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p = 2m + 1 is a prime congruent to 3 modulo 4 if and only if Tm = m(m + 1)/2 cannot be expressed as a sum of two odd squares and a triangular number, i.e., p = x+8(y+z) for no odd integers x, y, z. We also sh...