• Education of Primary School Mathematics
• /
• v.22 no.1
• /
• pp.65-82
• /
• 2019

In this study, students' multiplication expression method according to visual model was analyzed through paper test and eye tracking test. As a result of the paper-pencil test, students were presented with multiplication formula. In the group model (number of individual pieces in a group) ${\times}$ (number of group) in the array model (column) ${\times}$ (row), but in the array model, the proportion of students who answered the multiplication formula in the (row) ${\times}$ (column). From these results, we derived the appropriate model presentation method for multiplication instruction and the multiplication expression method for visual model.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.3
• /
• pp.617-622
• /
• 2005

In this paper, using Gauss multiplication formula, a recurrence relation for Bernoulli numbers, generalizing Namias' results, is given.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.3
• /
• pp.102-109
• /
• 2001

In this paper, a new multiplication algorithm which describes the methods of constructing a multiplierover GF(p$^{m}$ ) was presented. For the multiplication of two elements in the finite field, the multiplication formula was derived. Multiplier structures which can be constructed by this formula were considered as well. For example, both GF(3) multiplication module and GF(3) addition module were realized by current-mode CMOS technology. By using these operation modules the basic cell used in GF(3$^{m}$ ) multiplier was realized and verified by SPICE simulation tool. Proposed multipliers consisted of regular interconnection of simple cells use regular cellular arrays. So they are simply expansible for the multiplication of two elements in the finite field increasing the degree m.

• Kyungpook Mathematical Journal
• /
• v.18 no.2
• /
• pp.285-288
• /
• 1978

• Journal of applied mathematics & informatics
• /
• v.41 no.6
• /
• pp.1365-1376
• /
• 2023

In this paper, we construct higher-order poly-tangent polynomials and study several properties, including addition formula and multiplication formula. Finally, we explore the distribution of roots of higher-order poly-tangent polynomials.

• Journal of applied mathematics & informatics
• /
• v.42 no.2
• /
• pp.457-469
• /
• 2024

In this paper, we construct higher-order (p, q)-poly-tangent numbers and polynomials and give several properties, including addition formula and multiplication formula. Finally, we explore the distribution of roots of higher-order (p, q)-poly-tangent polynomials.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.105-125
• /
• 2005

Motivated by the field experimental designs in agriculture, the theory of block designs has been applied to several areas such as statistics, combinatorics, communication networks, distributed systems, cryptography, etc. An explicit formula and its fast computational algorithm for a class of symmetric balanced incomplete block designs are presented. Based on the formula and the careful investigation of the modulus multiplication table, the algorithm is developed. The computational costs of the algorithm is superior to those of the conventional ones.

• Journal of applied mathematics & informatics
• /
• v.39 no.3_4
• /
• pp.455-467
• /
• 2021

In this paper, we define twisted q-Euler polynomials of the second kind and explore some properties. We find generating function of twisted q-Euler polynomials of the second kind. Also, we investigate twisted q-Raabe's multiplication formula and (w, q)-alternating power sums of twisted q-Euler polynomials of the second kind. At the end, we define twisted q-Hurwitz's type Euler zeta function of the second kind.

• Honam Mathematical Journal
• /
• v.34 no.4
• /
• pp.505-512
• /
• 2012

In this paper, we give some properties on submodule transforms.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.333-349
• /
• 2019

We give explicitly an average value formula under the multiplication-by-2 map for the x-coordinates of the 2-division points D on the Jacobian variety J(C) of a hyperelliptic curve C with genus g if $2D{\equiv}2P-2{\infty}$ (mod Pic(C)) for $P=(x_P,y_P){\in}C$ with $y_P{\neq}0$. Moreover, if g = 2, we give a more explicit formula for D such that $2D{\equiv}P-{\infty}$ (mod Pic(C)).