• East Asian mathematical journal
• /
• v.36 no.2
• /
• pp.291-315
• /
• 2020

In this study, the geometric model of 11 factorization formulas presented in the 2015 revised national curriculum was constructed and the necessary mathematical conditions were derived in the process. As a result of the study, all of the 11 factorization formulas are geometrically modeled and 12 conditions are derived in the process. However, the basic method of directly cutting and attaching a given shape was limited to not being able to make a rectangle or rectangular parallelepiped. Therefore, the problem was solved by changing the perspective and focusing on whether rectangle or rectangular parallelepiped with the same area or volume could be constructed.

• Journal of the Korean Mathematical Society
• /
• v.47 no.6
• /
• pp.1197-1222
• /
• 2010

There is a well-known classical reduction formula by Griffiths and Harris for Littlewood-Richardson coefficients, which reduces one part from each partition. In this article, we consider an extension of the reduction formula reducing two parts from each partition. This extension is a special case of the factorization theorem of Littlewood-Richardson coefficients by King, Tollu, and Toumazet (the KTT theorem). This case of the KTT factorization theorem is of particular interest, because, in this case, the KTT theorem is simply a reduction formula reducing two parts from each partition. A bijective proof using tableaux of this reduction formula is given in this paper while the KTT theorem is proved using hives.

• Communications of Mathematical Education
• /
• v.29 no.1
• /
• pp.111-130
• /
• 2015

The purpose of the study was to investigate the differences between two groups of students according to information recognition styles such as visual learners and linguistic learners. Two instructional methods, algeblocks and factorization formula, were utilized to introduce the factorization. Four students were participated for the study, and two of them were visual learners and the other two were linguistic learners based on learning style test. Interviews and the diagnostic tests were implemented before the instructions which were lasted for 6 sessions. After the instructions all the participants were interviewed and the researchers also interviewed them 5 days later. The results of the study were the followings: 1. All the participants regardless of their learning style revealed that algeblocks were helpful in understanding the factorization. 2. Visual learners were more likely using algeblocks, while the linguistic learners were more enthusiastic and proficient in using formula to solve the problems. 3. Five days later, two types of learning style students revealed different tendencies. Visual learners mainly used algeblocks, and linguistic learners were not enthusiastic about using algeblocks and one of them did not use them at all. 4. Five days later, two visual learners could not remember the formula, but linguistic learners could remember the formula in somewhat different level.

• Honam Mathematical Journal
• /
• v.32 no.2
• /
• pp.271-281
• /
• 2010

Inspired by the reduction formulae between intersection numbers on Grassmannians obtained by Griffiths-Harris and the factorization theorem of Littlewood-Richardson coefficients by King, Tollu and Toumazet, eight reduction formulae has been discovered by the author and others. In this paper, we prove r = 1 reduction formula by constructing a bijective map between suitable sets of Littlewood-Richardson tableaux.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.2
• /
• pp.106-112
• /
• 2007

This paper proposes a hybrid architecture algorithm for fast computation of DCT and DFT via recursive factorization. Recursive factorization of DCT-II and DFT transform matrix leads to a similar architectural structure so that common architectural base may be used by simply adding a switching device. Linking between two transforms was derived based on matrix recursion formula. Hybrid acrchitectural design for DCT and DFT matrix decomposition were derived using the generation matrix and the trigonometric identities and relations. Data flow diagram for high-speed architecture of Cooley-Tukey type was drawn to accommodate DCT/DFT hybrid architecture. From this data flow diagram computational complexity is comparable to that of the fast DCT algorithms for moderate size of N. Further investigation is needed for multi-mode operation use of FFT architecture in other orthogonal transform computation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.107-112
• /
• 2011

It is very difficult to factorize composite number, $n=pq$ to integer factorization, p and q that is almost similar length of digits. Integer factorization algorithms, for the most part, find ($a,b$) that is congruence of squares ($a^2{\equiv}b^2$ (mod $n$)) with using factoring(factor base, B) and get the result, $p=GCD(a-b,n)$, $q=GCD(a+b,n)$ with taking the greatest common divisor of Euclid based on the formula $a^2-b^2=(a-b)(a+b)$. The efficiency of these algorithms hangs on finding ($a,b$) and deciding factor base, B. This paper proposes a efficient algorithm. The proposed algorithm extracts B from integer factorization with 3 digits prime numbers of $n+1$ and decides f, the combination of B. And then it obtains $x$(this is, $a=fxy$, $\sqrt{n}$ < $a$ < $\sqrt{2n}$) from integer factorization of $n-2$ and gets $y=\frac{a}{fx}$, $y_1$={1,3,7,9}. Our algorithm is much more effective in comparison with the conventional Fermat algorithm that sequentially finds $\sqrt{n}$ < $a$.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.3
• /
• pp.102-110
• /
• 2000

In this paper, Wiener-Hopf design of the two-degree-of-freedom(2DOF) controller configuration is treated for the standard plant model. It is shown that the 2DOF structure makes it possible to treat the design of feedback properties and reference tracking problem separately. Wiener-Hopf factorization technique is used to obtain the optimal controller which minimizes a given quadratic cost index. The class of all stabilizing controllers that yield finite cost index is also characterized. An illustrative example is given for the step reference tracking problem which can not be treated by the conventional H2 controller formula.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.324-329
• /
• 2003

The public-key cryptosystems such as Diffie-Hellman Key Distribution and Elliptical Curve Cryptosystems are built on the basis of the operations defined in GF(2$^{m}$ ):addition, subtraction, multiplication and multiplicative inversion. It is important that these operations should be computed at high speed in order to implement these cryptosystems efficiently. Among those operations, as being the most time-consuming, multiplicative inversion has become the object of lots of investigation Formant's theorem says $\beta$$^{-1}$ =$\beta$$^{2}$sup m/-2/, where $\beta$$^{-1}$ is the multiplicative inverse of $\beta$$\in$GF(2$^{m}$ ). Therefore, to compute the multiplicative inverse of arbitrary elements of GF(2$^{m}$ ), it is most important to reduce the number of times of multiplication by decomposing 2$^{m}$ -2 efficiently. Among many algorithms relevant to the subject, the algorithm proposed by Itoh and Tsujii[2] has reduced the required number of times of multiplication to O(log m) by using normal basis. Furthermore, a few papers have presented algorithms improving the Itoh and Tsujii's. However they have some demerits such as complicated decomposition processes[3,5]. In this paper, in the case of 2$^{m}$ -2, which is mainly used in practical applications, an efficient algorithm is proposed for computing the multiplicative inverse at high speed by using both the factorization formula x$^3$-y$^3$=(x-y)(x$^2$＋xy＋y$^2$) and normal basis. The number of times of multiplication of the algorithm is smaller than that of the algorithm proposed by Itoh and Tsujii. Also the algorithm decomposes 2$^{m}$ -2 more simply than other proposed algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.157-164
• /
• 2011

It is very difficult problem to factorize composite number. Integer factorization algorithms, for the most part, find ($a,b$) that is congruence of squares ($a^2{\equiv}b^2$(mode $n$)) with using factoring(factor base, B) and get the result, $p=GCD(a-b,n)$, $q=GCD(a+b,n)$ with taking the greatest common divisor of Euclid based on the formula $a^2-b^2=(a-b)(a+b)$. The efficiency of these algorithms hangs on finding ($a,b$). Fermat's algorithm that is base of congruence of squares finds $a^2-b^2=n$. This paper proposes the method to find $a^2-b^2=kn$, ($k=1,2,{\cdots}$). It is supposed $b_1$=0 or 5 to be surely, and b is a double number. First, the proposed method decides $k$ by getting kn that satisfies $b_1=0$ and $b_1=5$ about $n_2n_1$. Second, it decides $a_2a_1$ that satisfies $a^2-b^2=kn$. Third, it figures out ($a,b$) from $a^2-b^2=kn$ about $a_2a_1$ as deciding $\sqrt{kn}$ < $a$ < $\sqrt{(k+1)n}$ that is in $kn$ < $a^2$ < $(k+1)n$. The proposed algorithm is much more effective in comparison with the conventional Fermat algorithm.