• Title/Summary/Keyword: 짝수와 홀수

Search Result 97, Processing Time 0.02 seconds

Reflections on the instruction of even and odd numbers in elementary mathematics textbooks (초등학교 수학 교과서에 제시된 짝수와 홀수의 지도 내용에 대한 고찰)

  • Kim, Leena;Pang, JeongSuk
    • The Mathematical Education
    • /
    • v.62 no.4
    • /
    • pp.551-567
    • /
    • 2023
  • Even and odd numbers are taught in elementary school mathematics, but the introductory activities, definitions, and properties of sum on even and odd numbers vary depending on which grade they are presented. The purpose of this study was to compare and analyze the activities related to even and odd numbers presented in Korean mathematics textbooks developed under the different curriculum revisions, and to further analyze the related activities in foreign textbooks to draw implications for the teaching of even and odd numbers. In Korean textbooks, from the time of the fourth mathematics curriculum until the 2007 revision, even and odd numbers were covered in the multiples and divisors unit of the fifth grade textbook, while since the 2009 revision, the first grade textbook has covered the topic along with teaching numbers up to 50 or 100. In addition, the definitions of even and odd numbers varied depending on the grade level and the nature of the unit being taught, and activities addressing the properties of sum were only presented in the mathematics textbook under the third curriculum along with a few mathematics workbooks. In foreign textbooks, even and odd numbers were introduced in Grades 1, 2, or 5, and their related activities varied accordingly. Based on these findings, this study discusses the implications for the teaching of even and odd numbers.

The Magic Square Algorithm (마방진 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.159-166
    • /
    • 2017
  • This paper proposes an algorithm for odd, doubly even, and singly even magic squares. In constructing an odd magic square, de la $Loub{\grave{e}}re^{\prime}s$ method is widely known and used, but it has an inherent defect of executing $O(n^2)$ steps. 2 types of cross algorithms have been proposed to the double even magic square, and more to the singly even magic square based on the odd magic square of ${\frac{n}{2}}{\times}{\frac{n}{2}}$, the most popular and simple of which is one proposed by Strachey. The algorithm proposed in this paper successfully constructs odd and doubly even magic squares by undergoing 3 steps and 4 steps respectively. It also directly constructs a singly even magic square without having its basis on the odd magic square.

Studies on the Compositions of Odd number Fatty acid of Vegetability lipids (식물성 유지의 홀수 지방산에 대하여(호도, 복숭아씨, 살구씨를 중심으로))

  • 차월석;유의경김연순
    • KSBB Journal
    • /
    • v.8 no.1
    • /
    • pp.49-54
    • /
    • 1993
  • The contents of odd number fatty acid in walnut, peach seed and apricot seed were analyzed by HPLC. The results were as follows; the contents of crude oil in walnut, peach seed and apricot seed were 61.7%, 48.21%, and 52.34%, respectively. The contents of neutral lipid in walnut peach seed, and apricot seed were contained 62.32%, 91.50%, and 88.00%, respectively. The contents of glycolipid in walnut peach seed and apricot seed were contained 34.14%, 3.25%, and 4.78%, respectively. The contents of phospholipid in walnut peach seed and apricot seed were contained 3.54%, 5.25%, and 7.27%, respectively. The contents of odd number fatty acid and even number fatty acid in neutralipid were walnut 37.07% and 36.72%, peach seed 5.4% and 94.60%, and apricot seed 6.85% and 93.92%, respectively. The contents of odd number fatty acid and even number fatty acid in glycolipid were walnut 5.37% and 46.21%, peach seed 6.97% and 89.42%, and apricot seed 10.50% and 89.42%, respectively. The contents of odd number fatty acid and even number fatty acid in phospholipld were walnut 3.57% and 96.43%, peach speed 6.51% and 93.49%, and apricot seed 15.00% and 84.20%, respectively. The contents of odd number fatty and even number fatty acid in total fatty acid were walnut 14.47% and 85.53%, peach seed 1.17% and 98.83%, and apricot seed 4.3% and 95.97%, respectively.

  • PDF

Deblurring of the Blurred Image Caused by the Vibration of the Interlaced Scan Type Digital Camera (인터레이스드 스캔방식 디지털 카메라의 떨림에 의한 영상블러 제거)

  • Chon Jcechoon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.23 no.2
    • /
    • pp.165-175
    • /
    • 2005
  • If the interlaced scan type camera moves while an image is filming from the camera, blur is often created from the misalignment of the two images of even and odd lines. This paper proposed an algorithm which removes the misalignment of the even and odd line images cased by the vibration of the interlaced scan type camera. The blurred original image is separated into the even and the odd line images as half size. Based on these two images, two full sized images are generated using interpolation technique. If a big difference between these two interpolated images is generated, the original image is taken while the camera is moving. In this case, a deblurred image is obtained with the alignment of these separated two images through feature point extraction, feature point matching, sub-pixel matching, outlier detection, and image mosaicking processes. This paper demonstrated that the proposed algorithm can create clear images from blurred images caused by various camera motions.

Modification of Cubic Convolution Interpolation Based on Even-Odd Decomposition (홀수 짝수 분해법에 기초한 CCI 변형)

  • Cho, Hyun-Ji;Yoo, Hoon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.11a
    • /
    • pp.220-222
    • /
    • 2013
  • 본 논문에서는 짝수 홀수 분해법 (even-odd decomposition; EOD) 에 기초한 CCI (cubic convolution interpolation) 변형된 방법을 제안한다. CCI는 선형보간법과 더불어 영상 보간에서 가장 많이 사용되는 보간법이다. 선형보간법과 비교하여 우수한 화질을 제공하지만, 복잡도 상당히 증가하는 문제점을 갖고 있다. 따라서, 본 논문은 최근 제안된 짝수 홀수 분해법을 활용하여 CCI에 대한 새로운 보간 방법을 제시한다. 제안된 방법의 성능을 검증하기 위해서 실험이 수행되었고 실험결과는 변형된 CCI 보간 방법이 복잡도를 줄임과 동시에 영상 화질을 개선할 수 있음을 보여 주었다.

  • PDF

Kernel Analysis of Weighted Linear Interpolation Based on Even-Odd Decomposition (짝수 홀수 분해 기반의 가중 선형 보간법을 위한 커널 분석)

  • Oh, Eun-ju;Yoo, Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.11
    • /
    • pp.1455-1461
    • /
    • 2018
  • This paper presents a kernel analysis of weighted linear interpolation based on even-odd decomposition (EOD). The EOD method has advantages in that it provides low-complexity and improved image quality than the CCI method. However, since the kernel of EOD has not studied before and its analysis has not been addressed yet, this paper proposes the kernel function and its analysis. The kernel function is divided into odd and even terms. And then, the kernel is accomplished by summing the two terms. The proposed kernel is adjustable by a parameter. The parameter influences efficiency in the EOD based WLI process. Also, the kernel shapes are proposed by adjusting the parameter. In addition, the discussion with respect to the parameter is given to understand the parameter. A preliminary experiment on the kernel shape is presented to understand the adjustable parameter and corresponding kernel.

A Study on the Caseded-Type Multi-Level Inverter System (Cascaded 멀티-레벨 인버터 시스템에 관한 연구)

  • 강대욱
    • Proceedings of the KIPE Conference
    • /
    • 2000.07a
    • /
    • pp.321-324
    • /
    • 2000
  • 멀티-레벨 인버터 구조는 크게 세 가지가 있다 NPC 구조, 플라잉 커패시터 구조, 그리고 H-bridge 단위 인버터 셀을 종속적으로 연결한 cascaded 구조가 그것이다. 이중에서 cascaded 구조는 지금까지 홀수 레벨만 존재하는 것으로 알려졌다 본 논문에서는 이것을 짝수 레벨로 확장한 새로운 구조를 제안하고 홀수 짝수 레벨 모두에 적용이 가능한 새로온 PWM 기법을 제안하고자 한다. 제안한 기법은 컴퓨터 시뮬레이션 및 실험으로 그타당성을 입증하고자 한다.

  • PDF

Generallization of Semi-bent functions and their Construction Method (Semi-bent 함수의 일반화와 구성 방법)

  • Park, Sang-Woo;Chee, Seong-Taek;Kim, Kwang-Jo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.6 no.3
    • /
    • pp.31-40
    • /
    • 1996
  • In [4, 12], Chee et al. proposed a new class of cryptographic primitive, 'semi-bent functions', which exists on only odd dimensional vector spaces [4]. In this paper, we discuss new notion of generalized semi-bent functions which can be defined on any vector spaces. And we suggest systematic methods for constructing generalized semi-bent functions and analyse their cryptographic properties. In addition, we show that SUC fulfilling Boolean functions can be found on any dimensional vector spaces.

A review on teaching contents in area of Korean math textbook for first grade - even and odd number, composition and decomposition of numbers, calculation with carrying or with borrowing - (우리나라 초등학교 1학년 수학 교과서 <수와 연산> 영역의 지도 내용 검토 - 짝수.홀수, 수의 합성.분해, 받아올림.받아내림이 있는 계산 -)

  • Lee, Seung;Choi, Kyoung A;Park, Kyo Sik
    • Journal of the Korean School Mathematics Society
    • /
    • v.18 no.1
    • /
    • pp.1-14
    • /
    • 2015
  • In this paper, in order to improve the teaching contents on even and odd number, composition and decomposition of numbers, and (1 digit)+(1 digit) with carrying, (10 and 1 digit)-(1 digit) with borrowing, the corresponding teaching contents in ${\ll}$Math 1-1${\gg}$, ${\ll}$Math 1-2${\gg}$ are critically reviewed. Implications obtained through this review can be summarized as follows. First, the current incomplete definition of even and odd numbers would need to be reconsidered, and the appropriateness of dealing with even and odd numbers in first grade would need to be reconsidered. Second, it is necessary to deal with composition and decomposition of numbers less than 20. That is, it need to be considered to compose (10 and 1 digit) with 10 and (1 digit) and to decompose (10 and 1 digit) into 10 and (1 digit) on the basis of the 10. And the sequence dealing with composition and decomposition of 10 before dealing with composition and decomposition of (10 and 1 digit) need to be considered. And it need to be considered that composing (10 and 1 digit) with (1 digit) and (1 digit) and decomposing (10 and 1 digit) into (1 digit) and (1 digit) are substantially useless. Third, it is necessary to eliminate the logical leap in the calculation process. That is, it need to be considered to use the composing (10 and 1 digit) with 10 and (1 digit) and decomposing (10 and 1 digit) into 10 and (1 digit) on the basis of the 10 to eliminate the leap which can be seen in the explanation of calculating (1 digit)+(1 digit) with carrying, (10 and 1 digit)-(1 digit) with borrowing. And it need to be considered to deal with the vertical format for calculation of (1 digit)+(1 digit) with carrying and (10 and 1 digit)-(1 digit) with borrowing in ${\ll}$Math 1-2${\gg}$, or it need to be considered not to deal with the vertical format for calculation of (1 digit)+(1 digit) with carrying and (10 and 1 digit)-(1 digit) with borrowing in ${\ll}$Math 1-2 workbook${\gg}$ for the consistency.

The most promising first moves on small Go boards, based on pure Monte-Carlo Tree Search (순수 몬테카를로 트리탐색을 기반으로 한 소형 바둑판에서의 가장 유망한 첫 수들)

  • Lee, Byung-Doo
    • Journal of Korea Game Society
    • /
    • v.18 no.6
    • /
    • pp.59-68
    • /
    • 2018
  • In spite of its simple rule, Go is one of the most complex strategic board games in the field of Artificial Intelligence (AI). Monte-Carlo Tree Search (MCTS) is an algorithm with best-first tree search, and has used to implement computer Go. We try to find the most promising first move using MCTS for playing a Go game on a board of size smaller than $9{\times}9$ Go board. The experimental result reveals that MCTS prefers to place the first move at the center in case of odd-sized Go boards, and at the central in case of even-sized Go boards.