نتایج جستجو برای: Pascal triangle' Ruffini-Horner's method
تعداد نتایج: 1646165 فیلتر نتایج به سال:
In this paper, after presenting the results of the generalization of Pascal triangle (using powers of base numbers), we examine some properties of the 112-based triangle, most of all regarding to prime numbers. Additionally, an effective implementation of ECPP method is presented which enables Magma computer algebra system to prove the primality of numbers with more than 1000 decimal digits. 1 ...
This work is devoted to a systematic investigation of triangular matrix forms of the Pascal Triangle. To start, the twelve matrix forms (collectively referred to as G-matrices) are presented. To highlight one way in which the G-matrices relate to each other, a set of four operators named circulant operators is introduced. These operators provide a new insight into the structure of the space of ...
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpiński gasket that can be built as the limit set, for the Hausdorff distance, of a convergent sequence of normalized compact blocks extracted from Pascal triangle modulo 2, we de...
The triangular array of binomial coefficients, or Pascal’s triangle, is formed by starting with an apex of 1. Every row of Pascal’s triangle can be seen as a line-graph, to each node of which the corresponding binomial coefficient is assigned. We show that the binomial coefficient of a node is equal to the number of ways the line-graph can be constructed when starting with this node and adding ...
Abstract—Frequency transformation with Pascal matrix equations is a method for transforming an electronic filter (analogue or digital) into another filter. The technique is based on frequency transformation in the s-domain, bilinear z-transform with pre-warping frequency, inverse bilinear transformation and a very useful application of the Pascal’s triangle that simplifies computing and enables...
In this article we introduce a new geometric object called hyperbolic Pascal simplex. This new object is presented by the regular hypercube mosaic in the 4-dimensional hyperbolic space. The definition of the hyperbolic Pascal simplex, whose hyperfaces are hyperbolic Pascal pyramids and faces are hyperbolic Pascals triangles, is a natural generalization of the definition of the hyperbolic Pascal...
The hyperbolic Pascal triangle HPT 4,q (q ≥ 5) is a new mathematical construction, which is a geometrical generalization of Pascal’s arithmetical triangle. In the present study we show that a natural pattern of rows of HPT 4,5 is almost the same as the sequence consisting of every second term of the well-known Fibonacci words. Further, we give a generalization of the Fibonacci words using the h...
In this paper, we study Ghiyath al-Din Jamshid al-Kashi's (1380-1429 A.D.) main mathematical achievements. We discuss his al-Risala al-muhitiyya ("The Treatise on the Circumference"), Risala al-watar wa'l-jaib ("The Treatise on the Chord and Sine"), and Miftah al-hisab ("The Key of Arithmetic"). In particular, we look at al-Kashi's fundamental theorem, his calcula...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید