Search Results for ""

For every positive integer n, there exists a circle which contains exactly n lattice points in its interior. H. Steinhaus proved that for every positive integer n, there ...

A number h which satisfies the conditions of the congruum problem: x^2+h=a^2 and x^2-h=b^2, where x,h,a,b are integers. The list of congrua is given by 24, 96, 120, 240, 336, ...

Consecutive numbers (or more properly, consecutive integers) are integers n_1 and n_2 such that n_2-n_1=1, i.e., n_2 follows immediately after n_1. Given two consecutive ...

The largest cube dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, ... (OEIS A008834).

A natural number n>3 such that n|(a^(n-2)-a) whenever (a,n)=1 (a and n are relatively prime) and a<=n. (Here, n|m means that n divides m.) There are an infinite number of ...

A delta sequence is a sequence of strongly peaked functions for which lim_(n->infty)int_(-infty)^inftydelta_n(x)f(x)dx=f(0) (1) so that in the limit as n->infty, the ...

An even number N for which N=0 (mod 4). The first few positive doubly even numbers are 4, 8, 12, 16, ... (OEIS A008586).

Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Then {U_((n-(D/n))/2)=0 (mod n) when (Q/n)=1; V_((n-(D/n))/2)=D (mod n) when (Q/n)=-1, ...

An Euler pseudoprime to the base b is a composite number n which satisfies b^((n-1)/2)=+/-1 (mod n). The first few base-2 Euler pseudoprimes are 341, 561, 1105, 1729, 1905, ...

The number of alternating permutations for n elements is sometimes called an Euler zigzag number. Denote the number of alternating permutations on n elements for which the ...