Displaying similar documents to “Enumeration in musical theory.”

Fibonacci numbers and Fermat's last theorem

Zhi-Wei Sun (1992)

Acta Arithmetica

Similarity:

Let Fₙ be the Fibonacci sequence defined by F₀=0, F₁=1, F n + 1 = F ₙ + F n - 1 ( n ≥ 1 ) . It is well known that F p - ( 5 / p ) ≡ 0 ( m o d p ) for any odd prime p, where (-) denotes the Legendre symbol. In 1960 D. D. Wall [13] asked whether p ² | F p - ( 5 / p ) is always impossible; up to now this is still open. In this paper the sum ∑ k ≡ r ( m o d 10 ) n k is expressed in terms of Fibonacci numbers. As applications we obtain a new formula for the Fibonacci quotient F p - ( 5 / p ) / p and a criterion for the relation p | F ( p - 1 ) / 4 (if p ≡ 1 (mod 4), where p ≠ 5 is an odd prime. We also prove that the affirmative...

On integers not of the form n - φ (n)

J. Browkin, A. Schinzel (1995)

Colloquium Mathematicae

Similarity:

W. Sierpiński asked in 1959 (see [4], pp. 200-201, cf. [2]) whether there exist infinitely many positive integers not of the form n - φ(n), where φ is the Euler function. We answer this question in the affirmative by proving Theorem. None of the numbers 2 k · 509203 (k = 1, 2,...) is of the form n - φ(n).

On the parity of generalized partition functions, III

Fethi Ben Saïd, Jean-Louis Nicolas, Ahlem Zekraoui (2010)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Improving on some results of J.-L. Nicolas [], the elements of the set 𝒜 = 𝒜 ( 1 + z + z 3 + z 4 + z 5 ) , for which the partition function p ( 𝒜 , n ) (i.e. the number of partitions of n with parts in 𝒜 ) is even for all n ≥ 6 are determined. An asymptotic estimate to the counting function of this set is also given.