• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.117-126
• /
• 2020

Let R be a commutative ring with identity. A proper ideal I of R is called 2-prime if for all a, b ∈ R such that ab ∈ I, then either a² or b² lies in I. In this paper, we study 2-prime ideals which are generalization of prime ideals. Our study provides an analogous to the prime avoidance theorem and some applications of this theorem. Also, it is shown that if R is a PID, then the families of primary ideals and 2-prime ideals of R are identical. Moreover, a number of examples concerning 2-prime ideals are given. Finally, rings in which every 2-prime ideal is a prime ideal are investigated.

• Journal for History of Mathematics
• /
• v.27 no.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.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.129-137
• /
• 2006

An XML labeling scheme is an efficient encoding method to determine the ancestor-descendant relationships of elements and the orders of siblings. Recently, many dynamic XML documents have appeared in the Web Services and the AXML(the Active XML), so we need to manage them with a dynamic XML labeling scheme. The prime number labeling scheme is a representative scheme which supports dynamic XML documents. It determines the ancestor-descendant relationships between two elements with the feature of prime numbers. When a new element is inserted into the XML document using this scheme, it has an advantage that an assigning the label of new element don't change the label values of existing nodes. But it has to have additional expensive operations and data structure for maintaining the orders of siblings. In this paper, we suggest the order number sharing method and algorithms categorized by the insertion positions of new nodes. They greatly minimize the existing method's sibling order maintenance cost.

• Journal of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.439-448
• /
• 2022

For a natural number n, let R(n) denote the number of representations of n as the sum of one square and five cubes of primes. In this paper, it is proved that the anticipated asymptotic formula for R(n) fails for at most $O(N^{{\frac{4}{9}+{\varepsilon}})$ positive integers not exceeding N.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.65-72
• /
• 2007

Labeling schemes which don't consider about frequent update in dynamic XML documents need relabeling process to reflect the changed label information whenever the tree of XML document is update. There is disadvantage of considerable expenses in the dynamic XML document which can occurs frequent update. To solve this problem, we suggest prime number labeling scheme that doesn't need relabeling process. However the prime number labeling scheme does not consider that it needs to update the sibling order of nodes in the tree of XML document. This update process needs much costs because the most of the tree of XML document has to be researched and rewritten. In this paper, we propose the prime number labeling scheme with sibling order value that can maintain the sibling order without researching or rewriting the tree of XML documents.

• Communications of the Korean Mathematical Society
• /
• v.11 no.3
• /
• pp.563-568
• /
• 1996

In this paper we study the ramification of prime ideals in the dihedral octic extension N over Q and estimate the possible discriminants of the octic number field N.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.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.

• Journal of applied mathematics & informatics
• /
• v.40 no.1_2
• /
• pp.61-68
• /
• 2022

Let M_p := 2^p - 1 be a Mersenne prime. In this article, we find integers a, b, c, d, e and n satisfying $\sum_{t=0}^{n}\;\({an+b\\ct+d}\)\;=\;M_{p^e}$ given a Mersenne prime number M_p. In order to find a special case that satisfies the above results, we reprove an well-known relation of a certain sum of binomial coefficients and a divisor function.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.1
• /
• pp.139-151
• /
• 2016

A k-total-coloring of a graph G is a coloring of $V{\cup}E$ using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number ${\chi}^{{\prime}{\prime}}(G)$ of G is the smallest integer k such that G has a k-total-coloring. Let G be a planar graph with maximum degree ${\Delta}$. In this paper, it's proved that if ${\Delta}{\geq}7$ and G does not contain adjacent 5-cycles, then the total chromatic number ${\chi}^{{\prime}{\prime}}(G)$ is ${\Delta}+1$.

• Communications of the Korean Mathematical Society
• /
• v.13 no.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$.