• Journal for History of Mathematics
• /
• v.16 no.1
• /
• pp.17-24
• /
• 2003

The Pythagorean equation $x^2{＋}y^2{=}z^2$ and Pythagorean triple had appeared in the Babylonian clay tablet made between 1900 and 1600 B. C. Another quadratic equation called Pell equation was implicit in an Archimedes' letter to Eratosthenes, so called ‘cattle problem’. Though elliptic equation were contained in Diophantos’ Arithmetica, a substantial progress for the solution of cubic equations was made by Bachet only in 1621 when he found infinitely many rational solutions of the equation $y^2{=}x^3{-}2$. The equation $y^2{=}x^3{+}c$ is the simplest of all elliptic equations, even of all Diophantine equations degree greater than 2. It is due to Bachet, Dirichlet, Lebesque and Mordell that the equation in better understood.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.1149-1159
• /
• 2018

A quadratic polynomial ${\Phi}_{a,b,c}(x,y,z)=x(ax+1)+y(by+1)+z(cz+1)$ is called universal if the diophantine equation ${\Phi}_{a,b,c}(x,y,z)=n$ has an integer solution x, y, z for any nonnegative integer n. In this article, we show that if (a, b, c) = (2, 2, 6), (2, 3, 5) or (2, 3, 7), then ${\Phi}_{a,b,c}(x,y,z)$ is universal. These were conjectured by Sun in [8].

• Review of KIISC
• /
• v.2 no.2
• /
• pp.25-30
• /
• 1992

본 논제에서는 원시근과 이차 잉여규를 중심으로 관련되는 암호학에 이용을 언급하기로 한다. 이외에도 이산로그(discrete logarithm), 연분수(conti-nued fraction), 여러 부정방정식(diophantine equation)의 이론등이 암호학에서 빈번히 사용되는 알고리즘의 근간을 이루는 이론들로 알려져 있다. 또한, 유사임의 수열(pseudo-random number sequence)을 만들기 위한 생성자 (generator)들 중에는 정수론에 기초하고 있는 것들이 않이 있다. 제2절에서는 정수의 위수와 원시근에 대한 성질을 논하고, 제 3절에서는 2차 잉여류와 Legender 기호를 소개한 후, 제4절에서 이들이 주로 사용되는 암호학의 분야를 논하기로 한다.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.61-74
• /
• 2006

Let G be a simple graph and let G denote its complement. We say that $\bar{G}$ is integral if its spectrum consists of integral values. In this work we establish a characterization of integral graphs which belong to the class $\bar{{\alpha}K_{a,a}\cup{\beta}K_{b,b}}$, where mG denotes the m-fold union of the graph G.

• Communications of the Korean Mathematical Society
• /
• v.22 no.2
• /
• pp.183-194
• /
• 2007

For an irreducible binomial polynomial $f(x)=x^n-b{\in}K[x]$ with a field K, we ask when does the mth iteration $f_m$ is irreducible but $m+1th\;f_{m+1}$ is reducible over K. Let S(n, m) be the set of b's such that $f_m$ is irreducible but $f_{m+1}$ is reducible over K. We investigate the set S(n, m) by taking K as the rational number field.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.5
• /
• pp.1347-1356
• /
• 2014

In this paper, we analyze the security of the KMOV public key cryptosystem. KMOV is based on elliptic curves over the ring $\mathbb{Z}_n$ where n = pq is the product of two large unknown primes of equal bit-size. We consider KMOV with a public key (n, e) where the exponent e satisfies an equation ex-(p+1)(q+1)y = z, with unknown parameters x, y, z. Using Diophantine approximations and lattice reduction techniques, we show that KMOV is insecure when x, y, z are suitably small.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1597-1617
• /
• 2017

The paper is devoted to the description of family of scalene triangles for which the triangle formed by the intersection points of bisectors with opposite sides is isosceles. We call them Sharygin triangles. It turns out that they are parametrized by an open subset of an elliptic curve. Also we prove that there are infinitely many non-similar integer Sharygin triangles.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.4
• /
• pp.1041-1054
• /
• 2014

Let $P{\geq}3$ be an integer and let ($U_n$) and ($V_n$) denote generalized Fibonacci and Lucas sequences defined by $U_0=0$, $U_1=1$; $V_0= 2$, $V_1=P$, and $U_{n+1}=PU_n-U_{n-1}$, $V_{n+1}=PV_n-V_{n-1}$ for $n{\geq}1$. In this study, when P is odd, we solve the equations $V_n=kx^2$ and $V_n=2kx^2$ with k | P and k > 1. Then, when k | P and k > 1, we solve some other equations such as $U_n=kx^2$, $U_n=2kx^2$, $U_n=3kx^2$, $V_n=kx^2{\mp}1$, $V_n=2kx^2{\mp}1$, and $U_n=kx^2{\mp}1$. Moreover, when P is odd, we solve the equations $V_n=wx^2+1$ and $V_n=wx^2-1$ for w = 2, 3, 6. After that, we solve some Diophantine equations.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.3
• /
• pp.378-385
• /
• 2008

This paper aims to present a polynomial approach to the steady-state optimal filtering for delayed systems. The design of the steady-state filter involves solving one polynomial equation and one spectral factorization. The key problem in this paper is the derivation of spectral factorization for systems with delayed measurement, which is more difficult than the standard systems without delays. To get the spectral factorization, we apply the reorganized innovation approach. The calculation of spectral factorization comes down to two Riccati equations with the same dimension as the original systems.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.2
• /
• pp.55-64
• /
• 1990

This paper concerned about a study on the direct pole placement PID self-tuning controller design for DC servo motor control system. The method of a direct pole placement self-tuning PID control for a DC servo motor of Robot manipulator tracks a reference velocity in spite of the parameters uncertainties in nonminimum phase system. In this scheme, the parameters of classical controller are estimated by the recursive least square (RLS)identification algorithm, the pole placement method and diophantine equation. A series of simulation in which minimum phase system and nonminimum phase system are subjected to a pattern of system parameter changes is presented to show some of the features of the proposed control algorithm. The proposed control algorithm which shown are effective for the practical application, and experiments of DC servo motor speed control for Robot manipulator by a microcomputer IBM-PC/AT are performed and the results are well suited.