Search Results for ""

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

There are two sorts of transforms known as the fractional Fourier transform. The linear fractional Fourier transform is a discrete Fourier transform in which the exponent is ...

Two integers n and m<n are (alpha,beta)-multiamicable if sigma(m)-m=alphan and sigma(n)-n=betam, where sigma(n) is the divisor function and alpha,beta are positive integers. ...

A number n such that the "LED representation" of n (i.e., the arrangement of horizonal and vertical lines seen on a digital clock or pocket calculator), n upside down, n in a ...

Let omega be the cube root of unity (-1+isqrt(3))/2. Then the Eisenstein primes are Eisenstein integers, i.e., numbers of the form a+bomega for a and b integers, such that ...

In a 1847 talk to the Académie des Sciences in Paris, Gabriel Lamé (1795-1870) claimed to have proven Fermat's last theorem. However, Joseph Liouville immediately pointed out ...

An n-manifold which cannot be "nontrivially" decomposed into other n-manifolds.

Find the m×n array of single digits which contains the maximum possible number of primes, where allowable primes may lie along any horizontal, vertical, or diagonal line. For ...

Consider the Euler product zeta(s)=product_(k=1)^infty1/(1-1/(p_k^s)), (1) where zeta(s) is the Riemann zeta function and p_k is the kth prime. zeta(1)=infty, but taking the ...