• School Mathematics
• /
• v.12 no.4
• /
• pp.619-638
• /
• 2010

In this paper, we listed and reviewed some properties on polygonal numbers, pyramidal numbers and Pascal's triangle, and Fibonacci sequence. We discussed that the properties of gnomonic numbers, polygonal numbers and pyramidal numbers are explained integratively by introducing the generalized k-dimensional pyramidal numbers. And we also discussed that the properties of those numbers and relationships among generalized k-dimensional pyramidal numbers, Pascal's triangle and Fibonacci sequence are suitable for teaching and learning of mathematical reasoning and connections.

• East Asian mathematical journal
• /
• v.40 no.2
• /
• pp.209-229
• /
• 2024

In this study, we design a teaching unit that constructs Pascal graphs and extended Pascal triangles to explore number patterns inherent in them. This teaching unit is designed to consider the diachronic process of teaching-learning by combining Dörfler's theoretical generalization model with Wittmann's design science ideas, which are applied to the didactical practice of mathematization. In the teaching unit, considering the teaching-learning level of prospective teachers who studied discrete mathematics, we generalize the well-known Pascal triangle and its number patterns to extended Pascal triangles which have directed graphs(called Pascal graphs) as geometric models. In this process, the use of symbols and the introduction of variables are exhibited as important means of generalization. It provides practical experiences of mathematization to prospective teachers by going through various steps of the generalization process targeting symbols. This study reflects Wittmann's intention in that well-understood mathematics and the context of the first type of empirical research as structure-genetic didactical analysis are considered in the design of the learning environment.

• Kyungpook Mathematical Journal
• /
• v.48 no.2
• /
• pp.331-335
• /
• 2008

In this paper, we investigate the number of ones in rows of Pascal's Rectangle. Using these results, we determine the existence of regular bipartite Steinhaus graphs. Also, we give an upper bound for the minimum degree of bipartite Steinhaus graphs.

• The Pure and Applied Mathematics
• /
• v.6 no.2
• /
• pp.121-127
• /
• 1999

We can get the Pascal's matrix of order n by taking the first n rows of Pascal's triangle and filling in with 0's on the right. In this paper we obtain some well known combinatorial identities and a factorization of the Stirling matrix from the Pascal's matrix.

• Communications of the Korean Mathematical Society
• /
• v.17 no.3
• /
• pp.383-387
• /
• 2002

Let p be an odd prime, and let f($\varkappa$) be the interpolating polynomial associated with a table of data points (j+1, (equation omitted) ) for 0$\leq$j$\leq$p. In this article, we find congruence identities modulo p of (p-1)!f($\varkappa$), (p-2)!f($\varkappa$), and (p-3)!f($\varkappa$). Moreover we present some conjectures of these types.

• The Mathematical Education
• /
• v.43 no.4
• /
• pp.391-398
• /
• 2004

It is well-known in the literature that the general term of a sequence can be represented by a linear combination of binomial coefficients. The theorem and its known proofs are not easy for highschool students to understand. In this paper we prove the theorem by a pictorial method and by a very short and easy inductive method to make the problem easy and accessible enough for highschool students.

• The Pure and Applied Mathematics
• /
• v.20 no.3
• /
• pp.207-221
• /
• 2013

In this work we study the tribonacci numbers. We find a tribonacci triangle which is an analog of Pascal triangle. We also investigate an efficient method to compute any $n$th tribonacci numbers by matrix method, and find periods of the sequence by taking modular tribonacci number.

• Communications of the Korean Mathematical Society
• /
• v.11 no.4
• /
• pp.1123-1135
• /
• 1996

In this paper, we introduce some properties of Steinhaus graphs of order n, and prove that the size of some special type of induced cycles in Steinhaus graphs of order n is bounded by $\left\lfloor \frac{n+3}{2} \right\rfloor$.

• Korean Journal of Mathematics
• /
• v.28 no.2
• /
• pp.191-203
• /
• 2020

Any powers of 11 are easily obtained from the Pascal triangle. In this work we study powering and negative powering of any k digit integers by means of certain arithmetic tables.

• Journal of Educational Research in Mathematics
• /
• v.13 no.4
• /
• pp.495-506
• /
• 2003

In this study, 1 investigated some properties on the special hyper-dimensional figures made by the principle of the performance of equivalent forms representation. I supposed 2 definitions on the making n-dimensional figure : a cone type(hypercube) and a pillar type(simplex). We can explain that there exists only 6 4-dimensional regular polytopes as there exists only 5 regular polygons. And there are many hyper-dimensional figures, they all have sufficient condition to show the general Euler' Characteristics. And especially, we could certificate that the simplest cone type and pillar types are fitted to Pascal's Triangle and Hasse's Diagram, each other.