• 한국수학교육학회지시리즈A:수학교육
• /
• 제50권3호
• /
• pp.309-327
• /
• 2011

In this paper, we extended the division algorithm for the integers to the finite decimals. Though the remainder for the finite decimals is able to be defined as various ways, the remainder could be defined as 'the remained amount' which is the result of the division and as "the remainder" only if 'the remained amount' is decided uniquely by certain conditions. From the definition of "the remainder" for the finite decimal, it could be inferred that 'the division by equal part' and 'the division into equal parts' are proper for the division of the finite decimal concerned with the definition of "the remainder". The finite decimal, based on the unit of measure, seemed to make it possible for us to think "the remainder" both ways: 1" in the division by equal part when the quotient is the discrete amount, and 2" in the division into equal parts when the quotient is not only the discrete amount but also the continuous amount. In this division context, it could be said that the remainder for finite decimal must have the meaning of the justice and the completeness as well. The theorem of the division algorithm for the finite decimal could be accomplished, based on both the unit of measure of "the remainder", and those of the divisor and the dividend. In this paper, the meaning of the division algorithm for the finite decimal was investigated, it is concluded that this theory make it easy to find the remainder in the usual unit as well as in the unusual unit of measure.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.151-163
• /
• 2004

In this paper, we improve several inequalities involving Tay-lor's remainder by using some variants of Gruss inequality.

• Journal of applied mathematics & informatics
• /
• 제38권3_4호
• /
• pp.221-238
• /
• 2020

Let G = (V (G), E(G)) be a graph and let g : V (G) → S₃ be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S₃ cordial remainder labeling of G if |v_g(i)-v_g(j)| ≤ 1 and |e_g(1)-e_g(0)| ≤ 1, where v_g(j) denotes the number of vertices labeled with j and e_g(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S₃ cordial remainder labeling is called a group S₃ cordial remainder graph. In this paper, we prove that subdivision of graphs admit a group S₃ cordial remainder labeling.

• Journal of applied mathematics & informatics
• /
• 제39권1_2호
• /
• pp.223-237
• /
• 2021

Let G = (V (G), E(G)) be a graph and let g : V (G) → S3 be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S3 cordial remainder labeling of G if |vg(i)-vg(j)| ≤ 1 and |eg(1)-eg(0)| ≤ 1, where vg(j) denotes the number of vertices labeled with j and eg(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S3 cordial remainder labeling is called a group S3 cordial remainder graph. In this paper, we prove that square of the path, duplication of a vertex by a new edge in path and cycle graphs, duplication of an edge by a new vertex in path and cycle graphs and total graph of cycle and path graphs admit a group S3 cordial remainder labeling.

• 대한가정학회지
• /
• 제40권12호
• /
• pp.159-170
• /
• 2002

This study, with a view to establishing the objective and concrete methodology of partition of properly by the married couple in the process of divorce, is to suggest the calculation method of impartial division of property by means of applying the system to division of remainder used in Germany. Generally, the process of estimating the amount of partitioned property has two steps, the first of which is to calculate the remainder of the husband and the wife each. The second step is to compare the remainders of the couple and calculate the difference in order for the spouse who has more to claim the payment of a half of the difference. This method has the advantage of dividing impartially the remainder obtained by labor in the married life.

• 한국수학교육학회지시리즈C:초등수학교육
• /
• 제19권3호
• /
• pp.193-210
• /
• 2016

연구자는 중상위권 이상의 학생들에게서, 문장제로 주어진 $10{\div}2.4$의 문제에서 몫을 4, 나머지를 4로 기록한 사례를 목격할 수 있었다. 이러한 흥미로운 반응으로부터 연구자는 소수 나눗셈에서 몫과 나머지를 학생들이 어떻게 인식하는지 자세히 살펴보고, 분석한 문제점에 따른 지도방안을 구안하였다. 연구결과 많은 학생들이 소수 나눗셈에서 나머지의 소수점 처리에서 오류를 범하는 것을 확인할 수 있었으며, 그것이 세로 나눗셈 알고리즘의 몫과 나머지 처리에서 발생하는 어려움 때문임을 알 수 있었다. 개선 방안으로, 가분수와 대분수의 특징을 살려 분수형태로 표현된 나눗셈의 결과에서 몫과 나머지를 인식하는 방식의 교수방법을 제안하였다. 이는 세로 나눗셈 방식이 갖는 것과의 비교를 통해, 각각의 방식이 갖는 장단점을 이용함과 동시에 소수 나눗셈의 몫과 나머지를 구하는 새로운 관점을 제시한다는 데 의의가 있다.

• 대한수학교육학회지:수학교육학연구
• /
• 제22권4호
• /
• pp.445-458
• /
• 2012

현재의 교과서는 소수의 나눗셈에서의 몫과 나머지와 관련하여 학생들과 교사들에게 다음의 세 가지 부적절한 관념을 심어줄 수 있다. 첫째, (자연수)${\div}$(자연수)의 계산 결과만이 몫이다. 둘째, 소수 나눗셈에서 몫과 나머지를 구할 때의 몫은 자연수이고, 나머지는 유일하다. 셋째, 소수 나눗셈에서의 몫이 소수로 나누어떨어지지 않을 때만 몫을 반올림한다. 학생들과 교사들이 이와 같은 부적절한 관념을 가지지 않도록 소수 나눗셈에서의 몫과 나머지 취급과 관련하여 다음과 같은 개선이 요구된다. 첫째, ${\ll}$교육과정 해설서${\gg}$에서 소수 나눗셈에서의 몫과 나머지의 의미를 명확히 제시해야 한다. 둘째, 교과서에서 이와 같은 부적절한 관념의 생성을 막을 수 있는 충분한 예나 문제 등을 제시해야 한다. 셋째, 지도서에서 소수 나눗셈에서의 몫과 나머지와 관련한 교과서의 교수학적 의도를 명확히 제시해야 한다.

• Journal of applied mathematics & informatics
• /
• 제26권1_2호
• /
• pp.307-316
• /
• 2008

Real life problems can be expressed as a congruence modulus n and split into a system of congruence equations in modulus factors of n. A system of congruence equations can be combined into a congruence equation under certain conditions. This paper uniquely presents and critically reviews the generalized Chinese Remainder Theorem (CRT) for combining systems of congruence equations into single congruence equations. Sequential and parallel implementation strategies of the generic CRT are outlined. A variety of unique applications of the CRT are discussed.

• Structural Engineering and Mechanics
• /
• 제38권5호
• /
• pp.619-631
• /
• 2011

This paper provides a complex variable BIE for solving the periodic notch problems in plane plasticity. There is no limitation for the configuration of notches. For the periodic notch problem, the remainder estimation technique is suggested. In the technique, the influences on the central notch from many neighboring notches are evaluated exactly. The influences on the central notch from many remote notches are approximated by one term with a multiplying factor. This technique provides an effective way to solve the problems of periodic structures. Several numerical examples are presented, and most of them have not been reported previously.

• 한국정보통신학회논문지
• /
• 제16권1호
• /
• pp.26-32
• /
• 2012

본 연구에서는 인공지능 알고리즘을 이용하여 밀리미터파 대역에서 사용되는 giga-bit modem을 위한 ASK 시스템의 성능 개선을 제안한다. 본 연구에서 적용할 인공지능 알고리즘은 퍼지 논리 시스템이다. 제안한 퍼지 논리 시스템의 입력은 수신단의 counter에서 발생하는 remainder와 remainder의 적분합을 이용하고, 출력은 LPF의 bandwidth이다. 본 연구의 유용성을 위해 제안한 방식과 bandwidth가 고정된 방식에 대해 BER 성능을 확인하는 시뮬레이션을 수행한다. 시뮬레이션을 통해 제안한 방식과 bandwidth가 고정된 방식의 성능을 비교 검토한다.