• Korean Journal of Mathematics
• /
• 제28권3호
• /
• pp.539-554
• /
• 2020

A set {a₁, a₂, …, a_m} of m distinct positive integers is called a D(-1)-m-tuple if the product of any distinct two elements in the set decreased by one is a perfect square. In this paper, we find a solution of Pellian equations which is constructed by D(-1)-triples and using this result, we prove the extendibility of D(-1)-pair with some conditions.

• 대한수학회보
• /
• 제53권3호
• /
• pp.699-709
• /
• 2016

Our paper is devoted to the study of certain diophantine equations on the ring of polynomials over a finite field, which are intimately related to algebraic formal power series which have partial quotients of unbounded degree in their continued fraction expansion. In particular it is shown that there are Pisot formal power series with degree greater than 2, having infinitely many large partial quotients in their simple continued fraction expansions. This generalizes an earlier result of Baum and Sweet for algebraic formal power series.

• East Asian mathematical journal
• /
• 제23권3호
• /
• pp.371-380
• /
• 2007

It is well known that the solutions of the Diophantine equation $x^2+xy-y^2=1$ is related to the Fibonacci sequence. In this study, we generalize the above fact to the tribonacci sequence and its generalized from using the group structure of solutions of some Diophantine equations.

• 동력기계공학회지
• /
• 제9권4호
• /
• pp.175-180
• /
• 2005

Incorrections between model and plant are parameter, system order uncertainties and modeling error due to disturbance like friction. Therefore to achieve a good tracking performance, adaptive discrete time sliding mode tracking controller is used under time-varying desired position. Based on the diophantine equation, a new discrete time sliding function is defined and utilized for the control law. Robustness is increased by using both a recursive least-square method and a sliding function-based nonlinear feedback. The effectiveness of the proposed control algorithm is proved by the results of simulation and experiment.

• 대한수학회논문집
• /
• 제28권2호
• /
• pp.209-224
• /
• 2013

The problem of finding rational or integral points of an elliptic curve basically boils down to solving a cubic equation. We look closely at the cubic formula of Cardano to find a criterion for a cubic polynomial to have a rational or integral roots. Also we show that existence of a rational root of a cubic polynomial implies existence of a solution for certain Diophantine equation. As an application we find some integral solutions of some special type for $y^2=x^3+b$.

• 한국항행학회논문지
• /
• 제13권5호
• /
• pp.756-762
• /
• 2009

비선형 마찰인 유압 작동기의 스틱-슬립 마찰은 정확성과 응답성에 문제가 된다. 그러므로 마찰보상은 다양한 제어알고리즘을 통하여 연구되어 왔다. 적응이산시간 슬라이딩 추종제어기는 유압작동기 내의 비선형 마찰 특성을 보상하기 위하여 적용하였다. 다오판틴 방정식을 기초로 하여 새로운 이산시간 슬라이딩 함수는 마찰과 모델링 오차를 포함하여 제어법칙을 정의하였다. 비선형 파라미터의 추종성을 기초로 슬라이딩 함수와 프로젝션 항수를 이용하여 강인성을 높였다. 시뮬레이션과 실험결과는 좋은 추종성능을 얻었다.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.39-49
• /
• 2004

Let G be a simple graph and let $\={G}$ denotes its complement. We say that G is integral if its spectrum consists entirely of integers. If $\overline{aK_{a}\;{\bigcup}\;{\beta}K_{b}}$ is integral we show that it belongs to the class of integral graphs $[\frac{kt}{\tau}\;{x_0}\;+\;\frac{mt}{\tau}\;z}\;K_{(t+{\ell}n)+{\ell}m}\;\bigcup\;[\frac{kt}{\tau}\;{y_0}\;+\;\frac{(t\;+\;{\ell}n)k\;+\;{\ell}m}{\tau}\;z]n\;K_{em)$, where (i) t, k, $\ell$, m, $n\;\in\;\mathbb{N}$ such that (m, n) = 1, (n,t) = 1 and ($\ell,\;t$) = 1 ; (ii) $\tau\;=\;((t\;+\;{\ell}n)k\;+\;{\ell}m,\;mt)$ such that $\tau\;$\mid$kt$; (iii) ($x_0,\;y_0$) is a particular solution of the linear Diophantine equation $((t\;+\;{\ell}n)k\;+\;{\ell}m)x\;-\;(mt)y\;=\;\tau\;and\;(iv)\;z\;{\geq}\;{z_0}$ where $z_{0}$ is the least integer such that $(\frac{kt}{\tau}\;{x_0}\;+\;\frac{mt}{\tau}\;{z_0})\;\geq\;1\;and\;(\frac{kt}{\tau}\;{y_0}\;+\;\frac{(t+{\ell}n)k+{\ell}m}{\tau}\;{z_0})\;\geq\;1$.

• 대한수학회보
• /
• 제52권2호
• /
• pp.513-524
• /
• 2015

Here, we show that the title equation has no positive integer solutions (m, n), where ${\phi}$ is the Euler function.

• 호남수학학술지
• /
• 제40권1호
• /
• pp.139-153
• /
• 2018

Let $P{\geq}3$ be an integer and let ($U_n$) denote generalized Fibonacci sequence defined by $U_0=0$, $U_1=1$ and $U_{n+1}=PU_n-U_{n-1}$ for $n{\geq}1$. In this study, when P is odd, we solve the equation $U_n=11x^2+1$. We show that only $U_1$ and $U_2$ may be of the form $11x^2+1$.

• 충청수학회지
• /
• 제34권4호
• /
• pp.327-334
• /
• 2021

In this paper, we find all the prime numbers p that satisfy the following statement. If a positive integer k is a divisor of p - 1, then there is a sequence consisting of all k-th power residues modulo p, satisfying the recurrence equation of the Fibonacci sequence modulo p.