Displaying 2501 – 2520 of 3014

Showing per page

On the power-series expansion of a rational function

D. V. Lee (1992)

Acta Arithmetica

Introduction. The problem of determining the formula for P S ( n ) , the number of partitions of an integer into elements of a finite set S, that is, the number of solutions in non-negative integers, h s , . . . , h s k , of the equation hs₁ s₁ + ... + hsk sk = n, was solved in the nineteenth century (see Sylvester [4] and Glaisher [3] for detailed accounts). The solution is the coefficient of x i n [(1-xs₁)... (1-xsk)]-1, expressions for which they derived. Wright [5] indicated a simpler method by which to find part of the solution...

On the prime density of Lucas sequences

Pieter Moree (1996)

Journal de théorie des nombres de Bordeaux

The density of primes dividing at least one term of the Lucas sequence L n ( P ) n = 0 , defined by L 0 ( P ) = 2 , L 1 ( P ) = P and L n ( P ) = P L n - 1 ( P ) + L n - 2 ( P ) for n 2 , with P an arbitrary integer, is determined.

On the prime factors of non-congruent numbers

Lindsey Reinholz, Blair K. Spearman, Qiduan Yang (2015)

Colloquium Mathematicae

We give infinitely many new families of non-congruent numbers where the first prime factor of each number is of the form 8k+1 and the rest of the prime factors have the form 8k+3. Products of elements in each family are shown to be non-congruent.

Currently displaying 2501 – 2520 of 3014