• 제목/요약/키워드: prime number

검색결과 374건 처리시간 0.024초

Simple table 방법에 의한 논리함수 최소화의 신방법 (A new approach to the minimization of switching functions by the simple table method)

  • 황희융
    • 전기의세계
    • /
    • 제28권6호
    • /
    • pp.61-77
    • /
    • 1979
  • This paper is concerned with minimization process of the binary logic function. This paper describes an algorithm called the SIMPLE TABLE METHOD that well suited to minimization a switching function of any number of variables. For the Simple Table construction, a theorem based upon the numerical properties of the logic function is derived from the relationships governing minterms of the given function. Finally the minimal sum of products can be obtained in terms of the Direct Method or the Indirect Method from the table and table characteristics derived from the Simple Table. The properties and table characteristics used in this paper are described. All the minterms of a switching function are manipulated only by decimal numbers, not binary numbers. Some examples are used as a vehicle to guide the readers who are familiar with the Karnaugh map and Quine-McCluskey tabular method to this New method. These examples not only treat how to handle Don't Care miterms but also show the multiple output functions.

  • PDF

A MEAN VALUE FUNCTION AND ITS COMPUTATIONAL FORMULA RELATED TO D. H. LEHMER'S PROBLEM

  • Wang, Tingting
    • 대한수학회보
    • /
    • 제53권2호
    • /
    • pp.487-494
    • /
    • 2016
  • Let p be an odd prime and c be a fixed integer with (c, p) = 1. For each integer a with $1{\leq}a{\leq}p-1$, it is clear that there exists one and only one b with $0{\leq}b{\leq}p-1$ such that $ab{\equiv}c$ mod p. Let N(c, p) denote the number of all solutions of the congruence equation $ab{\equiv}c$ mod p for $1{\leq}a$, $b{{\leq}}p-1$ in which a and $\bar{b}$ are of opposite parity, where $\bar{b}$ is defined by the congruence equation $b{\bar{b}}{\equiv}1$ mod p. The main purpose of this paper is using the mean value theorem of Dirichlet L-functions and the properties of Gauss sums to study the computational problem of one kind mean value function related to $E(c,p)=N(c,p)-{\frac{1}{2}}{\phi}(p)$, and give its an exact computational formula.

전정질환의 측두골 조직병리 (Vestibular Histopathology in Temporal Bone)

  • 남성일
    • Research in Vestibular Science
    • /
    • 제17권4호
    • /
    • pp.130-133
    • /
    • 2018
  • There are a number of reports on the pathologies of vestibular disorders. However, these studies included only a few examples, which were not quantitative but merely anecdotal or descriptive. However, a single tissue section may be relevant to a specific disease in multiple ways. The histopathological characteristics of common peripheral vestibulopathies, including benign paroxysmal positional vertigo, $M{\acute{e}}ni{\grave{e}}re^{\prime}s$ syndrome, labyrinthitis, vestibular neuritis, and ototoxicity, have been described. A recent study validated a new quantitative method for determining vestibular otopathology. Detailed quantitative analyses of vestibular pathology are required to obtain a deeper understanding of the vestibular system. Such studies will likely reveal the pathophysiological causes of specific diseases by elucidating the correlations between structural and functional features. Therefore, histopathological studies of vestibular disorders should be performed.

NEGACYCLIC CODES OF LENGTH 8ps OVER Fpm + uFpm

  • Klin-eam, Chakkrid;Phuto, Jirayu
    • 대한수학회보
    • /
    • 제56권6호
    • /
    • pp.1385-1422
    • /
    • 2019
  • Let p be an odd prime. The algebraic structure of all negacyclic codes of length $8_{p^s}$ over the finite commutative chain ring ${\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}$ where $u^2=0$ is studied in this paper. Moreover, we classify all negacyclic codes of length $8_{p^s}$ over ${\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}$ into 5 cases, i.e., $p^m{\equiv}1$ (mod 16), $p^m{\equiv}3$, 11 (mod 16), $p^m{\equiv}5$, 13 (mod 16), $p^m{\equiv}7$, 15 (mod 16) and $p^m{\equiv}9$ (mod 16). From that, the structures of dual and some self-dual negacyclic codes and number of codewords of negacyclic codes are obtained.

NEW CONGRUENCES WITH THE GENERALIZED CATALAN NUMBERS AND HARMONIC NUMBERS

  • Elkhiri, Laid;Koparal, Sibel;Omur, Nese
    • 대한수학회보
    • /
    • 제58권5호
    • /
    • pp.1079-1095
    • /
    • 2021
  • In this paper, we give new congruences with the generalized Catalan numbers and harmonic numbers modulo p2. 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 qp(2) is Fermat quotient.

ON COEFFICIENT PROBLEMS FOR STARLIKE FUNCTIONS RELATED TO VERTICAL STRIP DOMAINS

  • Kwon, Oh Sang;Sim, Young Jae
    • 대한수학회논문집
    • /
    • 제34권2호
    • /
    • pp.451-464
    • /
    • 2019
  • In the present paper, we find the sharp bound for the fourth coefficient of starlike functions f which are normalized by f(0) = 0 = f'(0) - 1 and satisfy the following two-sided inequality: $$1+{\frac{{\gamma}-{\pi}}{2\;{\sin}\;{\gamma}}}\;<\;{\Re}\{{\frac{zf^{\prime}(z)}{f(z)}}\}\;<\;1+{\frac{{\gamma}}{2\;{\sin}\;{\gamma}}},\;z{\in}{\mathbb{D}}$$, where ${\mathbb{D}}:=\{z{\in}{\mathbb{C}}:{\left|z\right|}<1\}$ is the unit disk and ${\gamma}$ is a real number such that ${\pi}/2{\leq}{\gamma}<{\pi}$. Moreover, the sharp bound for the fifth coefficient of f defined above with ${\gamma}$ in a subset of [${\pi}/2,{\pi}$) also will be found.

Pashinyan's Gambit or Armenia's Failed Revolution

  • ABADJIAN, VAHRAM
    • Acta Via Serica
    • /
    • 제5권1호
    • /
    • pp.121-152
    • /
    • 2020
  • The article is a critical examination of the political developments in Armenia since the 'Velvet Revolution' of April-May 2018, when, on the wave of massive protests against the ruling regime, new young forces came to power raising amongst broad segments of population enormous enthusiasm and hopes about radical reforms that would lead to profound transformations in the political and socio-economic spheres. It contains a thorough analysis of underlying political processes in the country in an attempt to answer a number of topical questions, so important to get a deeper understanding of the situation in Armenia and in the South Caucasus region. Based on the analysis of the new authorities' performance against the acknowledged benchmarks and standards of democracy consolidation, such as: separation of powers, independence of the judiciary, good governance, transitional justice the author comes to the conclusion that they failed to achieve any breakthrough in the above-mentioned fields. On the contrary, as demonstrated by concrete examples, what occurred in Armenia was not a revolution but a mere regime change under the leadership of Prime Minister Pashinyan, who gradually has concentrated in his hands executive, legislative, and quasi-totality of the judicial branch of power.

Intelligent Automated Cognitive-Maturity Recognition System for Confidence Based E-Learning

  • Usman, Imran;Alhomoud, Adeeb M.
    • International Journal of Computer Science & Network Security
    • /
    • 제21권4호
    • /
    • pp.223-228
    • /
    • 2021
  • As a consequence of sudden outbreak of COVID-19 pandemic worldwide, educational institutes around the globe are forced to switch from traditional learning systems to e-learning systems. This has led to a variety of technology-driven pedagogies in e-teaching as well as e-learning. In order to take the best advantage, an appropriate understanding of the cognitive capability is of prime importance. This paper presents an intelligent cognitive maturity recognition system for confidence-based e-learning. We gather the data from actual test environment by involving a number of students and academicians to act as experts. Then a Genetic Programming based simulation and modeling is applied to generate a generalized classifier in the form of a mathematical expression. The simulation is derived towards an optimal space by carefully designed fitness function and assigning a range to each of the class labels. Experimental results validate that the proposed method yields comparative and superior results which makes it feasible to be used in real world scenarios.

CRYPTOGRAPHIC ALGORITHM INVOLVING THE MATRIX Qp*

  • Kannan, J.;Mahalakshmi, M.;Deepshika, A.
    • Korean Journal of Mathematics
    • /
    • 제30권3호
    • /
    • pp.533-538
    • /
    • 2022
  • Cryptography is one of the most essential developing areas, which deals with the secure transfer of messages. In recent days, there are more number of algorithms have been evolved to provide better security. This work is also such an attempt. In this paper, an algorithm is presented for encryption and decryption which employs the matrix Qp* and the well- known equation x2 - py2 = 1 where p is a prime.