• 한국정보처리학회논문지
• /
• 제7권9호
• /
• pp.2913-2919
• /
• 2000

비대칭 암호 알고리즘을 설계하는 데 있어서 매우 큰 소수를 구하는 것은 필수적이다. 그러나 지금까지는 결정론적인(deterministic) 큰 소수를 발견하기는 매우 어려웠기 때문에, 일반적으로 확률적으로 소수일 가능성이 높은 의사소수(psedoprime)를 비대칭 암호 알고리즘에서 사용하였다. 이 논문에서 결정론적인 소수 생성 방법을 제안하며, 제안된 방법에 의해 생성된 소수는 증명이 가능한 100% 정확한 소수이다. 또한 이 방법에 의해 생성된 소수는 신뢰성, 비도, 원시원소(primitive element)생성 능력 등을 보장한다.

• 대한수학교육학회지:학교수학
• /
• 제12권3호
• /
• pp.371-388
• /
• 2010

이 논문의 목적은 소수(素數, prime number) 개념을 처음 배우는 학생들이 소수와 그 관련 개념들을 어떻게 이해하고 있는지를 탐구하기 위한 것이다. 이를 위하여 소수와 합성수 개념을 학습한 직후의 중학교 1학년 학생들에게 설문조사를 중심으로 자료를 수집하고 분석하였다. 연구 결과, 학생들은 주어진 자연수의 소수성을 판정하기 위한 소수의 기능적인 정의를 선호하며, 주어진 자연수의 약수를 찾는 것에만 주목하여 소수와 합성수를 곱셈적 관계로 이해하는데 어려움을 나타내었다. 이러한 결과는 학생들이 자연수의 곱셈적 기본 단위로서 소수 개념의 본질적인 중요성을 인식하고 산술의 기본 정리가 보장하는 자연수의 곱셈적 구조를 이해할 수 있도록 하는 교수학적 전략의 필요성을 제안한다.

• 대한수학회보
• /
• 제60권4호
• /
• pp.933-955
• /
• 2023

For any prime number p, let J(p) be the set of positive integers n such that the numerator of the n^th harmonic number in the lowest terms is divisible by this prime number p. We consider an extension of this set to the generalized harmonic numbers, which are a natural extension of the harmonic numbers. Then, we present an upper bound for the number of elements in this set. Moreover, we state an explicit condition to show the finiteness of our set, together with relations to Bernoulli and Euler numbers.

• 대한수학회지
• /
• 제52권4호
• /
• pp.751-763
• /
• 2015

Let ${\alpha}$ be a positive integer, and let $p_1$, $p_2$ be two distinct prime numbers with $p_1$ < $p_2$. By using elementary methods, we give two equivalent conditions of all even near-perfect numbers in the form $2^{\alpha}p_1p_2$ and $2^{\alpha}p_1^2p_2$, and obtain a lot of new near-perfect numbers which involve some special kinds of prime number pairs. One kind is exactly the new Mersenne conjecture's prime number pair. Another kind has the form $p_1=2^{{\alpha}+1}-1$ and $p_2={\frac{p^2_1+p_1+1}{3}}$, where the former is a Mersenne prime and the latter's behavior is very much like a Fermat number.

• 호남수학학술지
• /
• 제7권1호
• /
• pp.129-133
• /
• 1985

The object of this note is to discuss the relationship between some matrix transformations that naturally occur involving prime numbers in the theory of Summability.

• 한국수학사학회지
• /
• 제27권3호
• /
• pp.183-195
• /
• 2014

In mathematics a prime number is the natural number that has no positive factors other than 1 and itself. As natural numbers greater than 1 can be factored characterized by prime numbers, identities of a culture could be understood if its cultural phenomena are analyzed through cultural prime numbers(CPN). It is not easy to resolve cultural phenomena into CPN and analyze them through CPN due to complexities of culture. Though it is difficult, however, it is not impossible. For CPN keeps relative independence in the context of history and thought. We call 2, 3 and 5 as CPN: 2 is representative of Yin and Yang theory, 3 of Three Principles theory, and 5 of Five Elements theory. We argue that the Ten Celestial Stems and the Twelve Earthly Branches, the core principles in the oriental tradition, could be factored by the CPN. Analyzing Sil-Hah Woo's arguments, we discuss that the CNP 3 achieved more qualitative valuation than the others in Korean culture.

• 대한수학회보
• /
• 제58권3호
• /
• pp.593-602
• /
• 2021

We use a kind of modified Hurwitz class numbers to express the number of representing a positive integer by some ternary quadratic forms such as the sum of three squares, and the Fourier coefficients of weight 2 modular forms of prime level with trivial character.

• 대한수학회보
• /
• 제45권1호
• /
• pp.143-155
• /
• 2008

Let p be a prime number. It is known that the order o(r) of a root r of the irreducible polynomial $x^p-x-l$ over $\mathbb{F}_p$ divides $g(p)=\frac{p^p-1}{p-1}$. Samuel Wagstaff recently conjectured that o(r) = g(p) for any prime p. The main object of the paper is to give some subsets S of {1,...,g(p)} that do not contain o(r).

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(2)
• /
• pp.136-139
• /
• 2000

In this paper, we propose a prime code and a new cryptographic algorithm for encryption and decryption as its application. The characteristics of prime numbers with irregular distribution and uniqueness are used to generate the prime code. Based on the prime code, an encryption algorithm for secret key is presented. Since the algorithm requires simpler operations than existing encryption such as DES, the burden for hardware implementation of the encryption and decryption process is alleviated.

• 대한수학회보
• /
• 제58권6호
• /
• pp.1463-1481
• /
• 2021

Divisibility properties of harmonic numbers by a prime number p have been a recurrent topic. However, finding the exact p-adic orders of them is not easy. Using class numbers of number fields and Bernoulli numbers, we compute the exact p-adic orders of harmonic type sums. Moreover, we obtain an asymptotic formula for generalized harmonic numbers whose p-adic orders are exactly one.