• 대한수학회보
• /
• 제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.

• East Asian mathematical journal
• /
• 제35권1호
• /
• pp.85-90
• /
• 2019

In this paper, we are interested in the evaluation of special values of the Dedekind zeta function of a totally real number field. In particular, we revisit Siegel method for values of the zeta function of a totally real number field at negative odd integers and explain how this method is applied to the case of non-normal totally real number field. As one of its applications, we give divisibility property for the values in the special case

• 정보보호학회논문지
• /
• 제9권1호
• /
• pp.103-114
• /
• 1999

전자 상거래에 대한 다양한 프로토타입(prototype)이 구현되고 있고, 확대적용의 현실성이 증대되고 있는 작금의 상황을 반영하여 관련 연구가 활발해지고 있으며, 그 중에서 보다 안전하고 효율적인 전자지불방식에 대한 현실적 요구가 증대하고 있다. 전자지불방식의 하나인 전자화폐는 실물 화폐와 유사한 성질들을 만족해야 하며, 이러한 성질들 중에서 필수적인 익명성을 얻기 위한 방법으로는 D. Chaum이 제안한 Blind Signature가 대표적이다. 본 논문에서는 기존의 암호시스템들이 가지고 있는 계산량 등의 문제점을 극복할 수 있는 방식으로써 주목받고 있는 타원곡선 암호시스템 상에서 서명자와 피서명자 간에 은닉 요소(blinding factor)를 교환함으로써 익명성을 제공하는 Elliptic Curve Blind Signature 기법을 제안한다. 또한, 제안 방식을 이용한 전자화폐 프로토콜에서 화폐 잔액에 대한 서명자의 재서명 과정을 통해 화폐의 분할성을 얻는 방법을 제시한다.

• 대한수학회보
• /
• 제41권3호
• /
• pp.473-482
• /
• 2004

Let D be an integral domain, I a proper ideal of D, and R =D[It, $t^{-1}$] a generalized Rees ring, where t is an indeterminate. For suitable conditions, we show that R satisfies the ACCP (resp., is a BFD, an FFD, a (pre-) Schreier domain, a G-GCD domain, a PVMD, a v-domain) if and only if D satisfies the ACCP (resp., is a BFD, an FFD, a (pre-) Schreier domain, a G-GCD domain, a PVMD, a v-domain).

• 대한수학회논문집
• /
• 제13권2호
• /
• pp.233-242
• /
• 1998

Let $k = Q(\sqrt{m})$ be a real quadratic field. In this paper, the following theorems on p-divisibility of the class number h of k are studied for each prime pp. Theorem 1. If the discriminant of k has at least three distinct prime divisors, then 2 divides h. Theorem 2. If an odd prime p divides h, then p divides $B_{a,\chi\omega^{-1}}$, where $\chi$ is the nontrivial character of k, and $\omega$ is the Teichmuller character for pp. Theorem 3. Let $h_n$ be the class number of $k_n$, the nth layer of the $Z_p$-extension $k_\infty$ of k. If p does not divide $B_{a,\chi\omega^{-1}}$, then $p \notmid h_n$ for all $n \geq 0$.

• Communications for Statistical Applications and Methods
• /
• 제9권2호
• /
• pp.347-354
• /
• 2002

An n-point design is maximal fan if all the models with n-terms satisfying the divisibility condition are estimable. Such designs tend to be space filling and look very similar to the ″Latin-hypercube″ designs used in computer experiments. Caboara, Pistone, Riccomago and Wynn (1997) conjectured that a maximal fan design on an integer grid exists for any n and m, where m is the number of factors. In this paper we examine the relationship between maximal fan design and latin-hypercube to give a partial solution for the conjecture.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제13권3호
• /
• pp.197-216
• /
• 2009

The purpose of this study was to investigate middle and high school mathematics teachers' levels and multiple approaches in United States practicing their abstraction levels and, different strategies and method of solutions towards given number theory problems. The mathematics teachers taking part in this study are consisted of 25 members of online graduate and undergraduate course (MAE 5641 and MAE 4813) delivered through Online Learning System called as the Blackboard (http://www.blackboard.com). Data collection methods include journal entries, written solutions to problems, the teachers' reflections on said problems, and post interviews. Data analysis was done based on [Hazzan, O. & Zazkis, R. (2005). Reducing abstraction: The case of school mathematics. Educ. Stud. Math. 58(1), 101-119]. Analysis of students' written solutions revealed that transitions among the solution methods have major effect on abstraction levels. Elevation and reducing abstraction is a dynamic process.

• Korean Journal of Mathematics
• /
• 제29권4호
• /
• pp.733-740
• /
• 2021

Let (F_n)_n≥0 be the Fibonacci sequence and p be a prime number. For 1≤k≤m, the Fibonomial coefficient is defined as $$\[\array{m\\k}\]_F=\frac{F_{m-k+1}{\ldots}{F_{m-1}F_m}}{{F_1}{\ldots}{F_k}}$$ and $\[\array{m\\k}\]_F=0$ whan k>m. Let a and n be positive integers. In this paper, we find the conditions of prime number p which divides Fibonomial coefficient $\[\array{P^{a+n}\\{p^a}}\]_F$. Furthermore, we also find the conditions of p when $\[\array{P^{a+n}\\{p^a}}\]_F$ is not divisible by p.

• 한국IT서비스학회지
• /
• 제9권4호
• /
• pp.219-229
• /
• 2010

The Green's equivalence relations have played a fundamental role in the development of semigroup theory. They are concerned with mutual divisibility of various kinds, and all of them reduce to the universal equivalence in a group. Boolean matrices have been successfully used in various areas, and many researches have been performed on them. Studying Green's relations on a monoid of boolean matrices will reveal important characteristics about boolean matrices, which may be useful in diverse applications. Although there are known algorithms that can compute Green relations, most of them are concerned with finding one equivalence class in a specific Green's relation and only a few algorithms have been appeared quite recently to deal with the problem of finding the whole D or J equivalence relations on the monoid of all $n{\times}n$ Boolean matrices. However, their results are far from satisfaction since their computational complexity is exponential-their computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and the size of the monoid of all $n{\times}n$ Boolean matrices grows exponentially as n increases. As an effort to reduce the execution time, this paper shows an isomorphism between the R relation and L relation on the monoid of all $n{\times}n$ Boolean matrices in terms of transposition. introduces theorems based on it discusses an improved algorithm for the J relation computation whose design reflects those theorems and gives its execution results.

• 통상정보연구
• /
• 제5권2호
• /
• pp.19-45
• /
• 2003

The main issues addressed in this paper are as follows : First, this paper makes a distinction among types of e-money, IC card type versus Network type, open-loop type versus closed-loop type, online type versus offline type and accountable type versus unaccountable type, and analysis the clear and accurate criterion. Second, generally speaking, e-money is a claim on originator of e-money and not legal tender, so, delivery of e-money by itself does not relieve of monetary obligation. Between it is not easy to define e-money, by now there are many definitions of e-money, there is a legal uncertainty accordingly and then it is not easy to find proper law applicable to resolve a particular issue. As a result. many problems relating to e-money would be solved through analogical application of the moot proper law among the laws that apply to the cash, check, credit card, or fund transfer after analyzing type of e-money at issue. This paper studies the methods on diffusion of the utilization of electronic money. To diffuse the usage of electronic money, it need; prerequisitely as a basic conditions independence of electronic money, non-reusability, and anonymity. And also as a additional conditions it need; usability in the offline commerce, transferability, divisibility. And now electronic money is used very actively, but still has many Jaw problems such as protections of consumer, law enforcement, supervisory, etc. So electronic money has called as money, but it is sure that electronic money is not a legal tender. So to facilitate the economic function of the electronic monel it is need to supplement the electronic money in the legal sides.