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

The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial selection (being used in factoring RSA challenge numbers) is to select a nonlinear polynomial for algebraic sieving and a linear polynomial for rational sieving. There is another method called a nonlinear method which selects two polynomials of the same degree greater than one. In this paper, we generalize Montgomery's method [12] using geometric progression (GP) (mod N) to construct a pair of nonlinear polynomials. We also introduce GP of length d + k with $1{\leq}k{\leq}d-1$ and show that we can construct polynomials of degree d having common root (mod N), where the number of such polynomials and the size of the coefficients can be precisely determined.

• School Mathematics
• /
• v.9 no.1
• /
• pp.1-12
• /
• 2007

The purpose of this study is searching for the problems and alternatives on teaching for repeating decimal. To accomplish the purpose, we have analyzed the fifth, sixth, and seventh Korean national curriculums, textbooks and examinations for the eighth grade about repeating decimal. W also have analyzed textbooks from USA to find for alternatives. As the results, we found followings. First, the national curriculums blocked us verifying the relation between rational number and repeating decimal. Second, definitions of terminating decimal, infinite decimal, and repeating decimal are slightly different in every textbooks. This leads seriously confusion for students examinations. The alternative on these problems is defining the terminating decimal as following; decimal which continually obtains only zeros in the quotient. That is, we have to avoid the representation of repeating decimal repeated nines under a declared system which apply an infinite decimal continually obtaining only zeros in the quotient. Then, we do not have any problems to verify the following statement. A number is a rational number if and only if it can be represented by a repeating decimal.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.818-825
• /
• 2008

This paper proposes an exponentiation method with Frobenius mappings. The main target is an exponentiation in an extension field. This idea can be applied for scalar multiplication of a rational point of an elliptic curve defined over an extension field. The proposed method is closely related to so-called interleaving exponentiation. Unlike interleaving exponentiation methods, it can carry out several exponentiations of the same base at once. This happens in some pairing-based applications. The efficiency of using Frobenius mappings for exponentiation in an extension field was well demonstrated by Avanzi and Mihailescu. Their exponentiation method efficiently decreases the number of multiplications by inversely using many Frobenius mappings. Compared to their method, although the number of multiplications needed for the proposed method increases about 20%, the number of Frobenius mappings becomes small. The proposed method is efficient for cases in which Frobenius mapping cannot be carried out quickly.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.10 no.5
• /
• pp.509-522
• /
• 1998

An experimental investigation is reported on the heat transfer coefficient from a rotating flat plate in a round turbulent normally impinging water jet. Tests were conducted over a range of jet flow rates, rotational speeds, jet radial posetions with various combinations of three jet nozzle diameter. Dimensionless correlation of average Nusselt number for laminar and turbulent flow is given in terms of jet and rotational Reynolds numbers, dimensionless jet radial position. We suggested various effective promotion methods according to heat transfer characteristics and aspects. The data presented herein will serve as a first step toward providing the information necessary to optimize in rational manner the cooling requirement of impingement cooled rotating machine components.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.12 no.1
• /
• pp.106-118
• /
• 2009

Satellite imagery with high resolution of about one meter is used widely in commerce and government applications ranging from earth observation and monitoring to national digital mapping. Due to the expensiveness of IKONOS Pro and Precision products, it is attractive to use the low-cost IKONOS Geo product with vendor-provided rational polynomial coefficients (RPCs), to produce highly accurate mapping products. The imaging geometry of IKONOS high-resolution imagery is described by RFs instead of rigorous sensor models. This paper presents four different polynomial models, that are the offset model, the scale and offset model, the Affine model, and the 2nd-order polynomial model, defined respectively in object space and image space to improve the accuracies of the RF-derived ground coordinates. Not only the algorithm for RF-based ground coordinates but also the algorithm for accuracy improvement of RF-based ground coordinates are developed which is based on the four models, The experiment also evaluates the effect of different cartographic parameters such as the number, configuration, and accuracy of ground control points on the accuracy of geopositioning. As the result of a experimental application, the root mean square errors of three dimensional ground coordinates which are first derived by vendor-provided Rational Function models were averagely 8.035m in X, 10.020m in Y and 13.318m in Z direction. After applying polynomial correction algorithm, those errors were dramatically decreased to averagely 2.791m in X, 2.520m in Y and 1.441m in Z. That is, accuracy was greatly improved by 65% in planmetry and 89% in vertical direction.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.1
• /
• pp.123-132
• /
• 2014

In this paper, we investigate the following form of a certain class of quadratic functional equations and its fuzzy stability. $$f(kx+y)+f(kx-y)=f(x+y)+f(x-y)-2(1-k^2)f(x)$$ where k is a fixed rational number with $k{\neq}1$, -1, 0.

• East Asian mathematical journal
• /
• v.36 no.3
• /
• pp.349-357
• /
• 2020

For a nondegenerate projective curve C ⊂ ℙ^r of degree d, it was shown that the Castelnuovo-Mumford regularity reg(C) of C is at most d - r + 2. And the curves of maximal regularity which attain the maximally possible value d - r + 2 are completely classified. In this short note, we first collect several known results about curves of maximal regularity. We provide a new proof and some partial results. Finally we suggest some interesting questions.

• Journal for History of Mathematics
• /
• v.15 no.1
• /
• pp.43-56
• /
• 2002

Hong, Jung-Ha(1684-\ulcorner ) explained 78 problems which look for the length of right triangle satisfying the given conditions by the Pythagorean theorem or the ratio of similarity in the chapter ‘Goo-Go-Hoh-Eun-Moon’of the 5th volume of his book Goo-Ill-Jeep. Most questions are formulated by equations of degree 2, 3, 4 which mostly have rational number solutions and part of the equations are expressed by counting stick. The explanation of each question describes the procedure to make the equation in detail, but only presents the solution with a few steps to solve.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.3
• /
• pp.451-456
• /
• 2004

Given a function on a scheme over a finite field, we can count the number of rational points of the scheme having the same values. We show that if the function, viewed as a morphism to the affine line, is proper and its higher direct image sheaves are tamely ramified at the infinity then the values are uniformly distributed up to some degree.

• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1635-1646
• /
• 2008

Schanuel's formula describes the distribution of rational points on projective space. In this paper we will extend it to algebraic points of bounded degree in the case of ${\mathbb{P}}^1$. The estimate formula will also give an explicit error term which is quite small relative to the leading term. It will also lead to a quasi-asymptotic formula for the number of points of bounded degree on ${\mathbb{P}}^1$ according as the height bound goes to $\infty$.