• Kyungpook Mathematical Journal
• /
• 제56권2호
• /
• pp.611-624
• /
• 2016

This paper gives for every positive integer n an explicit construction of a graph G with fewer than $15{\log}^2n-{\frac{5}{2}}{\log}n+28$ vertices, such that there exists a nontrivial factoring of n if and only if G is 3-colorable.

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

Using the recently developed ABS algorithm for solving linear Diophantine equations we introduce an algorithm for solving a system of m linear integer inequalities in n variables, m $\leq$ n, with full rank coefficient matrix. We apply this result to solve linear integer programming problems with m $\leq$ n inequalities.

• 대한수학회보
• /
• 제50권6호
• /
• pp.1981-1988
• /
• 2013

We say a positive integer n satisfies the Lehmer property if ${\phi}(n)$ divides n - 1, where ${\phi}(n)$ is the Euler's totient function. Clearly, every prime satisfies the Lehmer property. No composite integer satisfying the Lehmer property is known. In this article, we show that every composite integer of the form $D_{p,n}=np^n+1$, for a prime p and a positive integer n, or of the form ${\alpha}2^{\beta}+1$ for ${\alpha}{\leq}{\beta}$ does not satisfy the Lehmer property.

• 대한수학회지
• /
• 제53권6호
• /
• pp.1225-1236
• /
• 2016

Let R be a commutative ring with $1{\neq}0$ and n a positive integer. In this article, we introduce the n-Krull dimension of R, denoted $dim_n\;R$, which is the supremum of the lengths of chains of n-absorbing ideals of R. We study the n-Krull dimension in several classes of commutative rings. For example, the n-Krull dimension of an Artinian ring is finite for every positive integer n. In particular, if R is an Artinian ring with k maximal ideals and l(R) is the length of a composition series for R, then $dim_n\;R=l(R)-k$ for some positive integer n. It is proved that a Noetherian domain R is a Dedekind domain if and only if $dim_n\;R=n$ for every positive integer n if and only if $dim_2\;R=2$. It is shown that Krull's (Generalized) Principal Ideal Theorem does not hold in general when prime ideals are replaced by n-absorbing ideals for some n > 1.

• 대한수학회보
• /
• 제59권1호
• /
• pp.111-117
• /
• 2022

Let p_a,b,m(n) be the number of integer partitions of n with more parts congruent to a modulo m than parts congruent to b modulo m. We prove that p_a,b,m(n) ≥ p_b,a,m(n) whenever 1 ≤ a < b ≤ m. We also propose some conjectures concerning series with nonnegative coefficients in their expansions.

• 대한수학회논문집
• /
• 제25권2호
• /
• pp.167-171
• /
• 2010

We will show that if d is a cubefree integer and n is an integer, then with some suitable conditions, there are no primes p and a positive integer m such that d is a cubic residue (mod p), $3\;{\nmid}\;m$, p || n if and only if there are integers x, y, z such that $$x^3\;+\;dy^3\;+\;d^2z^3\;-\;3dxyz\;=\;n$$.

• 호남수학학술지
• /
• 제42권1호
• /
• pp.139-150
• /
• 2020

Let p be a prime number with p > 3, p ≡ 3 (mod 4) and let n be a positive integer. In this paper, we prove that the Diophantine equation (5pn² - 1)^x + (p(p - 5)n² + 1)^y = (pn)^z has only the positive integer solution (x, y, z) = (1, 1, 2) where pn ≡ ±1 (mod 5). As an another result, we show that the Diophantine equation (35n² - 1)^x + (14n² + 1)^y = (7n)^z has only the positive integer solution (x, y, z) = (1, 1, 2) where n ≡ ±3 (mod 5) or 5 | n. On the proofs, we use the properties of Jacobi symbol and Baker's method.

• 한국인터넷방송통신학회논문지
• /
• 제11권2호
• /
• pp.107-112
• /
• 2011

$n=pq$인 합성수 을 크기가 비슷한 p와 q로 소인수분해하는 것은 매우 어려운 문제이다. 대부분의 소인수분해 알고리즘은 $a^2{\equiv}b^2$ (mod $n$)인 제곱 합동이 되는 ($a,b$)를 소수의 곱 (인자 기준, factor base, B)으로 찾아 $a^2-b^2=(a-b)(a+b)$ 공식에 의거 유클리드의 최대공약수 공식을 적용하여 $p=GCD(a-b,n)$, $q=GCD(a+b,n)$으로 구한다. 여기서 ($a,b$)를 얼마나 빨리 찾는가에 알고리즘들의 차이가 있으며, B를 결정하는 어려움이 있다. 본 논문은 좀 더 효율적인 알고리즘을 제안한다. 제안된 알고리즘에서는 $n+1$을 3자리 소수까지 소인수분해하여 B를 추출하고 B의 조합 $f$를 결정한다. 다음으로, $a=fxy$가 되는 값을 $\sqrt{n}$ < $a$ < $\sqrt{2n}$ 범위에서 구하여 $n-2$의 소인수분해로 $x$를 얻고, $y=\frac{a}{fx}$, $y_1$={1,3,7,9}을 구한다. 제안된 알고리즘을 몇 가지 사례에 적용한 결과 $\sqrt{n}$ < $a$를 순차적으로 찾는 기존의 페르마 알고리즘에 비해 수행 속도를 현격히 단축시키는 효과를 얻었다.

• 대한수학회논문집
• /
• 제17권3호
• /
• pp.541-550
• /
• 2002

In this Paper, We look at 3 Simple function L assigning to an integer n the smallest positive integer n such that any product of n consecutive numbers is divisible by n. Investigated are the interesting properties of the function. The function L(n) is completely determined by L(p$\^$k/), where p$\^$k/ is a factor of n, and satisfies L(m$.$n) $\leq$ L(m)+L(n), where the equality holds for infinitely many cases.

• Kyungpook Mathematical Journal
• /
• 제46권4호
• /
• pp.581-589
• /
• 2006

We characterize the linear operators which preserve the factor rank of integer matrices. That is, if $\mathcal{M}$ is the set of all $m{\times}n$ matrices with entries in the integers and min($m,n$) > 1, then a linear operator T on $\mathcal{M}$ preserves the factor rank of all matrices in $\mathcal{M}$ if and only if T has the form either T(X) = UXV for all $X{\in}\mathcal{M}$, or $m=n$ and T(X)=$UX^tV$ for all $X{\in}\mathcal{M}$, where U and V are suitable nonsingular integer matrices. Other characterizations of factor rank-preservers of integer matrices are also given.