Abstract: The very well-known stacked sets of numbers referred
to as Pascal’s triangle present the coefficients of the binomial
expansion of the form (x+y)n. This paper presents an approach (the
Staircase Horizontal Vertical, SHV-method) to the generalization of
planar Pascal’s triangle for polynomial expansion of the form
(x+y+z+w+r+⋯)n. The presented generalization of Pascal’s triangle
is different from other generalizations of Pascal’s triangles given in
the literature. The coefficients of the generalized Pascal’s triangles,
presented in this work, are generated by inspection, using embedded
Pascal’s triangles. The coefficients of I-variables expansion are
generated by horizontally laying out the Pascal’s elements of (I-1)
variables expansion, in a staircase manner, and multiplying them with
the relevant columns of vertically laid out classical Pascal’s elements,
hence avoiding factorial calculations for generating the coefficients
of the polynomial expansion. Furthermore, the classical Pascal’s
triangle has some pattern built into it regarding its odd and even
numbers. Such pattern is known as the Sierpinski’s triangle. In this
study, a presentation of Sierpinski-like patterns of the generalized
Pascal’s triangles is given. Applications related to those coefficients
of the binomial expansion (Pascal’s triangle), or polynomial
expansion (generalized Pascal’s triangles) can be in areas of
combinatorics, and probabilities.
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 calculation by hand when transforming from one filter to
another. This paper will introduce two methods to transform a filter
into a digital filter: frequency transformation from the s-domain into
the z-domain; and frequency transformation in the z-domain. Further,
two Pascal matrix equations are derived: an analogue to digital filter
Pascal matrix equation and a digital to digital filter Pascal matrix
equation. These are used to design a desired digital filter from a given
filter.
Abstract: This paper presents two solutions to the Fermat’s Last Theorem (FLT). The first one using some algebraic basis related to the Pythagorean theorem, expression of equations, an analysis of their behavior, when compared with power and power and using " the “Well Ordering Principle” of natural numbers it is demonstrated that in Fermat equation . The second one solution is using the connection between and power through the Pascal’s triangle or Newton’s binomial coefficients, where de Fermat equation do not fulfill the first coefficient, then it is impossible that:
zn=xn+yn for n>2 and (x, y, z) E Z+ - {0}