On the equation $f^n + g^n = 1$

On the Multiplicative Order of Fn+1/fn modulo Fm

Here, we show that if s �∈ {1, 2, 4} is a fixed positive integer and m and n are coprime positive integers such that the multiplicative order of Fn+1/Fn modulo Fm is s, where Fk is the kth Fibonacci number, then m < 500s2.

1 The gn - logic style option

A combinatorial interpretation of the recurrence fn+1 = 6fn - fn-1

Bonin et al. (1993) recalled an open problem related to the recurrence relation verified by NSW numbers. The recurrence relation is the following: fn+l = 6f~ f~l , with jq = 1 and j~ = 7, and no combinatorial interpretation seems to be known. In this note, we define a regular language .~ whose number of words having length n is equal to f~+l. Then, by using .La we give a direct combinatorial pr...

Update on membranoproliferative GN.

Membranoproliferative GN represents a pattern of injury seen on light microscopy. Historically, findings on electron microscopy have been used to further subclassify this pathologic entity. Recent advances in understanding of the underlying pathobiology have led to a proposed classification scheme based on immunofluorescence findings. Dysregulation of the complement system has been shown to be ...

GN 1 ( GÉANT ) Deliverable D 9 . 1 - Addendum 1

This addendum specifies the implementation architecture for the Premium IP service described in Deliverable D 9.1, which aims at offering the equivalent of an end to end virtual leased line service at the IP layer across multiple domains. The architecture is targeted at the GÉANT network and is applicable to each connected NRENs and local Diffserv domains. The architectures leverages the scalab...