Results 71 to 80 of about 461 (158)

Tools for relatedness: “Fetishes” in Burkina Faso and the work of enacted metaphors

American Anthropologist, Volume 127, Issue 2, Page 233-243, June 2025.
Abstract In West Africa, certain objects can act in the world and interact with people as subjects. Labeled “fetishes” by Europeans, these material things have generated centuries of debates on the nature of their agency. In this article, I rely on participant fieldwork as a student in a group of initiated donso hunters in Burkina Faso, which involved ...
Lorenzo Ferrarini
wiley   +1 more source

Fibonacci Hierarchies for Decision Making [PDF]

All decisions are practically made within a chainwise social setup named a decision-making chain (DMC). This paper considers some cases of an idea (a project proposal) propagating through an organizational DMC.
Tokel, Emre, Yucel, Eray
core   +1 more source

Binet – Type Formula For The Sequence of Tetranacci Numbers by Alternate Methods

Mathematical Journal of Interdisciplinary Sciences, 2019
The sequence {Tn} of Tetranacci numbers is defined by recurrence relation Tn= Tn-1 + Tn-2 + Tn-3 + Tn-4; n≥4 with initial condition T0=T1=T2=0 and T3=1. In this Paper, we obtain the explicit formulla-Binet-type formula for Tn by two different methods. We use the concept of Eigen decomposition as well as of generating functions to obtain the result.
null Gautam S. Hathiwala, null Devbhadra V. Shah   +1 more
openaire   +2 more sources

On a unified approach to homogeneous second-order linear difference equations with constant coefficients and some applications

Special Matrices
In this article, we establish a new closed formula for the solution of homogeneous second-order linear difference equations with constant coefficients by using matrix theory.
Kaddoura Issam, Mourad Bassam
doaj   +1 more source

A New Generalization of Leonardo Sequences: Biperiodic Leonardo Sequence

Journal of Mathematics
In this study, we define a new type of number sequence called biperiodic Leonardo sequence by the recurrence relation Lena,b=aLen−1+Len−2+1 (for even n) and Lena,b=bLen−1+Len−2+1 (for odd n) with the initial conditions Le0a,b=Le1a,b=1.
Hasan Gökbaş
doaj   +1 more source

Exploring Generalized $2^k$-Fibonacci Sequence: A New Family of the Fibonacci Sequence

Communications in Advanced Mathematical Sciences
The focus of this paper is to study the $2^k$–Fibonacci sequence, which is defined for all integers $2^k$, and its connections with both the Fibonacci and the Fibonacci-Lucas sequences.
Elis Gardel Costa Mesquista, Eudes Antonio Costa, Paula Maria Machado Cruz Catarino   +2 more
doaj   +1 more source

A comparison of performance of subnormal, normal, and gifted children on the Oseretsky Tests of Motor Proficiency. [PDF]

, 1957
Thesis (Ed.D.)--Boston ...
Berk, Robert Lloyd
core   +1 more source

Generalization of the 2-Fibonacci sequences and their Binet formula

Notes on Number Theory and Discrete Mathematics
We will explore the generalization of the four different 2-Fibonacci sequences defined by Atanassov. In particular, we will define recurrence relations to generate each part of a 2-Fibonacci sequence, discuss the generating function and Binet formula of each of these sequences, and provide the necessary and sufficient conditions to obtain each type of ...
Timmy Ma, Richard Vernon, Gurdial Arora
openaire   +1 more source

Relevance to the theory of intelligence testing of the stugy of errors in thinking [PDF]

, 1956
In such a study as this it is impossible strictly to separate the statement of results and the discussion of them, and much that belongs under the heading of discussion is already contained in the preceding pages.
Donaldson, Margaret C.
core  

Algorithms for computing Fibonacci numbers quickly [PDF]

A study of the running time of several known algorithms and several new algorithms to compute the n[superscript th] element of the Fibonacci sequence is presented.
Holloway, J. L.
core   +1 more source