• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.7
• /
• pp.851-858
• /
• 1988

In this paper, we propose two different VLSI architectures for the parallel computation of DCT (discrete cosine transform) algorithm. First, it is shown that the DCT algorithm can be implemented on the existing systolic architecture for the DFT(discrete fourier transform) by introducing some modification. Secondly, a new prime factor DCT algorithm based on the prime factor DFT algorithm is proposed. And it is shown that the proposed algorihtm can be implemented in parallel on the systolic architecture for the prime factor DFT. However, proposed algorithm is only applicable to the data length which can be decomposed into relatively prime and odd numbers. It is also found that the proposed systolic architecture requires less multipliers than the structures implementing FDCT(fast DCT) algorithms directly.

• Fisheries and Aquatic Sciences
• /
• v.20 no.10
• /
• pp.26.1-26.9
• /
• 2017

Fishes in genus Sardinella are small pelagic species, which plays an important role in marine ecosystem as the first consumer. Those species are also commercially important, whose total catch reaches 278,600 tons in 2011 in Indonesia, but their identification has been difficult for their morphological similarity. In this study, we reported Sardinella jussieu for the first time in Indonesian coastal area (Banten Bay, Indonesia, $6^{\circ}\;0^{\prime}\;50.00^{{\prime}{\prime}}\;S-106^{\circ}\;10^{\prime}\;21.00^{{\prime}{\prime}}\;E$). We were able to confirm the species by both its morphological characteristics including the black spot at dorsal fin origin, the dusky pigmentation at caudal fin, 31 total scute numbers, and DNA sequence identity in the GenBank database by the molecular analysis. Its total mitochondrial genome was determined by the combination of next-generation sequencing and typical PCR strategy. The total mitochondrial genome of Sardinella jussieu (16,695 bp) encoded 13 proteins, 2 ribosomal RNAs, 22 transfer RNAs, and the putative control region. All protein-coding genes started with ATG and typical stop codon and ended with TAA or TAG except for ND4 in which AGA is used. Phylogenetic analyses of both COI region and full mitochondrial genome showed that S. jussieu is most closely related to Sardinella albella and Sardinella gibbosa

• The Pure and Applied Mathematics
• /
• v.23 no.3
• /
• pp.205-221
• /
• 2016

We formulate the additive entropy of a natural number in terms of the additive partition function, and show that its multiplicative entropy is directly related to the multiplicative partition function. We give a practical formula for the multiplicative entropy of natural numbers with two prime factors. We use this formula to analyze the comparative density of additive and multiplicative entropy, prove that this density converges to zero as the number tends to infinity, and empirically observe this asymptotic behavior.

• Journal of applied mathematics & informatics
• /
• v.37 no.3_4
• /
• pp.177-182
• /
• 2019

This study is about the number expressed and the number not expressed in terms of the sum of consecutive natural numbers with a difference of 2k. Since it is difficult to generalize in cases of onsecutive positive integers with a difference of 2k, the table of cases of 4, 6, 8, 10, and 12 was examined to find the normality and to prove the hypothesis through the results. Generalized guesswork through tables was made to establish and prove the hypothesis of the number of possible and impossible numbers that are to all consecutive natural numbers with a difference of 2k. Finally, it was possible to verify the possibility and impossibility of the sum of consecutive cases of 124 and 2010. It is expected to be investigated the sum of consecutive natural numbers with a difference of 2k + 1, as a future research task.

• Journal of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1103-1137
• /
• 2022

Our motivation in this note is to find equal hyperharmonic numbers of different orders. In particular, we deal with the integerness property of the difference of hyperharmonic numbers. Inspired by finiteness results from arithmetic geometry, we see that, under some extra assumption, there are only finitely many pairs of orders for two hyperharmonic numbers of fixed indices to have a certain rational difference. Moreover, using analytic techniques, we get that almost all differences are not integers. On the contrary, we also obtain that there are infinitely many order values where the corresponding differences are integers.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1079-1095
• /
• 2021

In this paper, we give new congruences with the generalized Catalan numbers and harmonic numbers modulo p². One of our results is as follows: for prime number p > 3, $${\sum\limits_{k=(p+1)/2}^{p-1}}\;k^2B_{p,k}B_{p,k-(p-1)/2}H_k{\equiv}(-1)^{(p-1)/2}\(-{\frac{521}{36}}p-{\frac{1}{p}}-{\frac{41}{12}}+pH^2_{3(p-1)/2}-10pq^2_p(2)+4\({\frac{10}{3}}p+1\)q_p(2)\)\;(mod\;p^2),$$ where q_p(2) is Fermat quotient.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.815-827
• /
• 2019

It is well known that the denominator of the Dedekind sum s(c, d) divides 2 gcd(d, 3)d and that no smaller denominator independent of c can be expected. In contrast, here we prove that we usually get a smaller denominator in S(H, d), the sum of the s(c, d)'s over all the c's in a subgroup H of order n > 1 in the multiplicative group $(\mathbb{Z}/d\mathbb{Z})^*$. First, we prove that for p > 3 a prime, the sum 2S(H, p) is a rational integer of the same parity as (p-1)/2. We give an application of this result to upper bounds on relative class numbers of imaginary abelian number fields of prime conductor. Finally, we give a general result on the denominator of S(H, d) for non necessarily prime d's. We show that its denominator is a divisor of some explicit divisor of 2d gcd(d, 3).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.103-109
• /
• 2013

Miller-Rabin method is the most prevalently used primality test. However, this method mistakenly reports a Carmichael number or semi-prime number as prime (strong lier) although they are composite numbers. To eradicate this problem, it selects k number of m, whose value satisfies the following : m=[2,n-1], (m,n)=1. The Miller-Rabin method determines that a given number is prime, given that after the computation of $n-1=2^sd$, $0{\leq}r{\leq}s-1$, the outcome satisfies $m^d{\equiv}1$(mod n) or $m^{2^rd}{\equiv}-1$(mod n). This paper proposes a step-by-step primality testing algorithm that restricts m=2, hence achieving 98.8% probability. The proposed method, as a first step, rejects composite numbers that do not satisfy the equation, $n=6k{\pm}1$, $n_1{\neq}5$. Next, it determines prime by computing $2^{2^{s-1}d}{\equiv}{\beta}_{s-1}$(mod n) and $2^d{\equiv}{\beta}_0$(mod n). In the third step, it tests ${\beta}_r{\equiv}-1$ in the range of $1{\leq}r{\leq}s-2$ for ${\beta}_0$ > 1. In the case of ${\beta}_0$ = 1, it retests m=3,5,7,11,13,17 sequentially. When applied to n=[101,1000], the proposed algorithm determined 96.55% of prime in the initial stage. The remaining 3% was performed for ${\beta}_0$ >1 and 0.55% for ${\beta}_0$ = 1.

• Honam Mathematical Journal
• /
• v.32 no.4
• /
• pp.791-795
• /
• 2010

We study the consequences of Gross's conjecture for cyclic extensions of degree $l^2$ where l is prime, and deduce that the L-values at s = 0 satisfy certain congruence relations.