Eugène Lefébure
Eugène Lefébure (11 November 1838 – 9 April 1908) was a French Egyptologist born at Prunoy.
Working with the French Archaeological Mission in the Valley of the Kings, he worked in the tomb of Ramesses IV (KV2). He also documented the tomb of Seti I and drew up plans for KV26, KV27, KV28, KV29, KV37, KV40, and KV59 and also WV24 and WV25. These plans, with the descriptions of their work, were published in the following:
Publications
- “Les Hypogées royaux of Thèbes”, 1889
- Rites égyptiens : construction et protection des édifices, 1996
Authority control  |
|
|---|
gollark: you PENGUINS.
gollark: HAS YOUR NOSE EXPLODED?
gollark: ```haskellimport Data.Listimport Data.Bits fib :: Int -> Integerfib n = snd . foldl_ fib_ (1, 0) . dropWhile not $ [testBit n k | k <- let s = bitSize n in [s-1,s-2..0]] where fib_ (f, g) p | p = (f*(f+2*g), ss) | otherwise = (ss, g*(2*f-g)) where ss = f*f+g*g foldl_ = foldl' -- '```
gollark: import Data.Listimport Data.Bits fib :: Int -> Integerfib n = snd . foldl_ fib_ (1, 0) . dropWhile not $ [testBit n k | k <- let s = bitSize n in [s-1,s-2..0]] where fib_ (f, g) p | p = (f*(f+2*g), ss) | otherwise = (ss, g*(2*f-g)) where ss = f*f+g*g foldl_ = foldl' -- '
gollark: 3.1 Using 2x2 matricesThe argument of iterateabove is a linear transformation, so we can represent it as matrix and compute the nth power of this matrix with O(log n) multiplications and additions.For example, using the simple matrix implementation in Prelude extensions,fib n = head (apply (Matrix [[0,1], [1,1]] ^ n) [0,1])
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.