• Title/Summary/Keyword: prime numbers

Search Result 111, Processing Time 0.024 seconds

A Deterministic Method of Large Prime Number Generation (결정론적인 소수 생성에 관한 연구)

  • Park, Jung-Gil;Park, Bong-Joo;Baek, Ki-Young;Chun, Wang-Sung;Ryou, Jae-Cheol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.9
    • /
    • pp.2913-2919
    • /
    • 2000
  • It is essential to get large prime numbers in the design of asymmetric encryption algorithm. However, the pseudoprime numbers with high possibility to be primes have been generally used in the asymmetric encryption algorithms, because it is very difficult to find large deterministic prime numbers. In this paper, we propose a new method of deterministic prime number generation. The prime numbers generated by the proposed method have a 100% precise prime characteristic. They are also guaranteed reliability, security strength, and an ability of primitive element generation.

  • PDF

Middle School Students' Understanding about Prime Number (소수(素數, prime number) 개념에 대한 중학생의 이해)

  • Cho, Kyoung-Hee;Kwon, Oh-Nam
    • School Mathematics
    • /
    • v.12 no.3
    • /
    • pp.371-388
    • /
    • 2010
  • The goals of this study are to inquire middle school students' understanding about prime number and to propose pedagogical implications for school mathematics. Written questionnaire were given to 198 Korean seventh graders who had just finished learning about prime number and prime factorization and then 20 students participated in individual interviews for member checks. In defining prime and composite numbers, the students focused on distinguishing one from another by numbering of factors of agiven natural number. However, they hardly recognize the mathematical connection between prime and composite numbers related on the multiplicative structure of natural number. This study suggests that it is needed to emphasize the conceptual relationship between divisibility and prime decomposition and the prime numbers as the multiplicative building blocks of natural numbers based on the Fundamental Theorem of Arithmetic.

  • PDF

ON THE p-ADIC VALUATION OF GENERALIZED HARMONIC NUMBERS

  • Cagatay Altuntas
    • 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 nth 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.

A CLASS OF NEW NEAR-PERFECT NUMBERS

  • LI, YANBIN;LIAO, QUNYING
    • Journal of the Korean Mathematical Society
    • /
    • v.52 no.4
    • /
    • pp.751-763
    • /
    • 2015
  • Let ${\alpha}$ be a positive integer, and let $p_1$, $p_2$ be two distinct prime numbers with $p_1$ < $p_2$. By using elementary methods, we give two equivalent conditions of all even near-perfect numbers in the form $2^{\alpha}p_1p_2$ and $2^{\alpha}p_1^2p_2$, and obtain a lot of new near-perfect numbers which involve some special kinds of prime number pairs. One kind is exactly the new Mersenne conjecture's prime number pair. Another kind has the form $p_1=2^{{\alpha}+1}-1$ and $p_2={\frac{p^2_1+p_1+1}{3}}$, where the former is a Mersenne prime and the latter's behavior is very much like a Fermat number.

On Some Matrix Transformations Involving Prime Numbers

  • Srinivasan, V.K.
    • Honam Mathematical Journal
    • /
    • v.7 no.1
    • /
    • pp.129-133
    • /
    • 1985
  • The object of this note is to discuss the relationship between some matrix transformations that naturally occur involving prime numbers in the theory of Summability.

  • PDF

'Cultural' Prime Numbers: 2, 3, and 5 ('문화적' 소수: 2, 3, 5)

  • Bae, Sun Bok;Park, Chang Kyun
    • 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.

ABOUT THE PERIOD OF BELL NUMBERS MODULO A PRIME

  • Car, Mireille;Gallardo, Luis H.;Rahavandrainy, Olivier;Vaserstein, Leonid N.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.45 no.1
    • /
    • pp.143-155
    • /
    • 2008
  • Let p be a prime number. It is known that the order o(r) of a root r of the irreducible polynomial $x^p-x-l$ over $\mathbb{F}_p$ divides $g(p)=\frac{p^p-1}{p-1}$. Samuel Wagstaff recently conjectured that o(r) = g(p) for any prime p. The main object of the paper is to give some subsets S of {1,...,g(p)} that do not contain o(r).

A BLOCK CRYPTOGRAPHIC ALGORITHM BASED ON A PRIME CODE (소수 코드를 이용한 블록 암호화 알고리즘)

  • 송문빈;오재곤;정연모
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.136-139
    • /
    • 2000
  • In this paper, we propose a prime code and a new cryptographic algorithm for encryption and decryption as its application. The characteristics of prime numbers with irregular distribution and uniqueness are used to generate the prime code. Based on the prime code, an encryption algorithm for secret key is presented. Since the algorithm requires simpler operations than existing encryption such as DES, the burden for hardware implementation of the encryption and decryption process is alleviated.

  • PDF

APPLICATIONS OF CLASS NUMBERS AND BERNOULLI NUMBERS TO HARMONIC TYPE SUMS

  • Goral, Haydar;Sertbas, Doga Can
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.6
    • /
    • pp.1463-1481
    • /
    • 2021
  • Divisibility properties of harmonic numbers by a prime number p have been a recurrent topic. However, finding the exact p-adic orders of them is not easy. Using class numbers of number fields and Bernoulli numbers, we compute the exact p-adic orders of harmonic type sums. Moreover, we obtain an asymptotic formula for generalized harmonic numbers whose p-adic orders are exactly one.