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

검색결과 4,027건 처리시간 0.033초

FIXED-WIDTH PARTITIONS ACCORDING TO THE PARITY OF THE EVEN PARTS

  • John M. Campbell
    • 대한수학회보
    • /
    • 제60권4호
    • /
    • pp.1017-1024
    • /
    • 2023
  • A celebrated result in the study of integer partitions is the identity due to Lehmer whereby the number of partitions of n with an even number of even parts minus the number of partitions of n with an odd number of even parts equals the number of partitions of n into distinct odd parts. Inspired by Lehmer's identity, we prove explicit formulas for evaluating generating functions for sequences that enumerate integer partitions of fixed width with an even/odd number of even parts. We introduce a technique for decomposing the even entries of a partition in such a way so as to evaluate, using a finite sum over q-binomial coefficients, the generating function for the sequence of partitions with an even number of even parts of fixed, odd width, and similarly for the other families of fixed-width partitions that we introduce.

오일러 방진 게임 퍼즐 규칙 알고리즘 (Puzzle Rule Algorithm of Euler Square Game)

  • 이상운
    • 산업융합연구
    • /
    • 제19권4호
    • /
    • pp.23-28
    • /
    • 2021
  • 본 논문은 미해결 문제로 알려진 36 장교문제(n = 6)와 관련된 오일러 방진 퍼즐 게임 문제에 대해 n = [3, ∞]의 문제를 풀 수 있는 일정한 패턴 규칙을 찾고자 시도하였다. 이 문제의 해는 현재까지 [3, 10]에 대해 n = 6만 존재하지 않고 나머지 모든 숫자에 대한 해는 존재하는 것으로 알려져 있다. 또한, 기존 연구는 특정 숫자 n에 대해 컴퓨터 프로그램으로 랜덤한 배정 결과를 찾고자 하여 n = [11, ∞]에 대해서는 해를 찾기가 쉽지 않아 미해결 과제로 남아있다. 기존 연구는 n = [3, 10]으로 한정시킨 반면에, 본 논문은 n = [3, ∞]영역에서 어떠한 n의 값에 대해서도 해를 찾을 수 있는 일반화된 패턴을 찾고자 시도하였다. 본 논문에서는 n = odd, 4k even, 4k+2 even의 세 부분으로 분할하여 n = odd와 4k even(n/2 = even)에 대한 간단하면서도 일정한 패턴을 찾는데 성공하였다. 그러나 4k+2 even(n/2 = odd)에 대해서는 패턴을 찾지 못하였다.

Odd-even Effects on the Surface Anchoring Strength and the Pretilt Angle Generation in NLC on Rubbed Polythiophene Surfaces with Alkyl Chain Lengths

  • Seo, Dae-Shik
    • 한국전기전자재료학회논문지
    • /
    • 제12권1호
    • /
    • pp.69-74
    • /
    • 1999
  • We have investigated that the high pretilt angle of the NLC, 4-n-pentyl-4-cyanobiphenyl (5CB), was observed on rubbed polythiophene (PTP) surfaces with alkyl chains with more than 10 carbon atoms; it is attributed to the surface-excluded volume effect by the alkyl chain lengths between the LCs and the PTP surfaces. Next, we investigated that the odd-even effect of the polar anchoring strength in 5CB on rubbed PTP surfaces with alkyl chain lengths has been successfully evaluated. The anchoring strength of 5CB for rubbed PTP surfaces with odd-number is weak compared with even-number up to the 6 carbon atoms in the alkyl chain; however, odd-number is strong compared with even-number above 7 carbon atoms. The weak anchoring strength of 5CB is approximately $1\times10^{-3} (J/m^2$) on rubbed PTP surface with 7 carbon atoms; it is relatively strong anchoring strength. Consequently, we conclude that the odd-even effects of the polar anchoring strength in NLCs are strongly related to the characteristics of the polymer and observed clearly for short alkyl chain lengths.

  • PDF

MOEPE: 스테레오 정합 하드웨어를 위한 Merged Odd-Even PE 구조 (MOEPE: Merged Odd-Even PE Architecture for Stereo Matching Hardware)

  • 한필우;양영일
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1998년도 추계종합학술대회 논문집
    • /
    • pp.1137-1140
    • /
    • 1998
  • In this paper, we propose the new hardware architecture which implements the stereo matching algorithm using the dynamic programming method. The dynamic programming method is used in finding the corresponding pixels between the left image and the right image. The proposed MOEPE(Merged Odd-Even PE) architecture operates in the systolic manner and finds the disparities from the intensities of the pixels on the epipolar line. The number of PEs used in the MOEPE architecture is the number of the range constraint, which reduced the number of the necessary PEs dramatically compared to the traditional method which uses the PEs with the number of pixels on the epipolar line. For the normal method by 25 times. The proposed architecture is modeled with the VHDL code and simulated by the SYNOPSYS tool.

  • PDF

한국 복식에 나타난 수의 상징성 (A Study on the Symbolism of the Number Expressed in Korean Costume)

  • 강윤숙
    • 복식
    • /
    • 제50권7호
    • /
    • pp.113-127
    • /
    • 2000
  • The purpose of this study was to examine the symbolic meaning of oriental numbers based on Yin-Yang(陰陽) theory. Based on the thought of Yin-Yang Wu-Hsing(陰陽五行), the number was divided the number of the heaven (positive number) 1, 3. 5, 7, 9 from the number cf the earth(negative number) 2. 4, 6, 8, 10. It was descrived very well in the dress and its ornaments and the folk customs. In the costume of the Court, there were 9, 7, 5, 3 patterns costume for the king and queen. Even though an even number, 12 patterns costume for the emperor symbolized 12 months and made it of the principal of the universe. Korean traditional costume Han-bock(韓服) was formed with the three dimentional principal of circle (圓.$\bigcirc$), square(方.$\square$) and triangularity(角.$\Delta$). In the middle of odd numbers, number 3 was regarded as a holy number of the heaven (天), the earth(地) and a man(人). Taken for a highest number. number 3 had the symbolism of wishes for good fortune. Number 10 and number 100, which meant the fullness and the long life, were used regularly. With Ten longevity patterns(十長生紋), the feast of a hundred-day-old baby, our race prayed for the healthy long life. As mentioned above. the symbolism of the number though the costume prefered the positive number to the negative one. Accommodating to the universal principal and the cycle. The deep meaning and the symbolism of the number has been implied the mental wishes.

  • PDF

Infinite Families of Congruences for Partition Functions ${\bar{\mathfrak{EO}}}$(n) and ${\mathfrak{EO}}_e$(n)

  • Riyajur Rahman;Nipen Saikia
    • Kyungpook Mathematical Journal
    • /
    • 제63권2호
    • /
    • pp.155-166
    • /
    • 2023
  • In 2018, Andrews introduced the partition functions ${\mathfrak{EO}}$(n) and ${\bar{\mathfrak{EO}}}$(n). The first of these denotes the number of partitions of n in which every even part is less than each odd part, and the second counts the number of partitions enumerated by the first in which only the largest even part appears an odd number of times. In 2021, Pore and Fathima introduced a new partition function ${\mathfrak{EO}}_e$(n) which counts the number of partitions of n which are enumerated by ${\bar{\mathfrak{EO}}}$(n) together with the partitions enumerated by ${\bar{\mathfrak{EO}}}$(n) where all parts are odd and the number of parts is even. They also proved some particular congruences for ${\bar{\mathfrak{EO}}}$(n) and ${\mathfrak{EO}}_e$(n). In this paper, we establish infinitely many families of congruences modulo 2, 4, 5 and 8 for ${\bar{\mathfrak{EO}}}$(n) and modulo 4 for ${\mathfrak{EO}}_e$(n). For example, if p ≥ 5 is a prime with Legendre symbol $({\frac{-3}{p}})=-1$, then for all integers n ≥ 0 and α ≥ 0, we have ${\bar{\mathfrak{EO}}}(8{\cdot}p^{2{\alpha}+1}(pn+j)+{\frac{19{\cdot}p^{2{\alpha}+2}-1}{3}}){\equiv}0$ (mod 8); 1 ≤ j ≤ (p - 1).

Some Congruences for Andrews' Partition Function ${\bar{\mathcal{EO}}}$(n)

  • Pore, Utpal;Fathima, Syeda Noor
    • Kyungpook Mathematical Journal
    • /
    • 제61권1호
    • /
    • pp.49-59
    • /
    • 2021
  • Recently, Andrews introduced partition functions ����(n) and ${\bar{\mathcal{EO}}}$(n) where the function ����(n) denotes the number of partitions of n in which every even part is less than each odd part and the function ${\bar{\mathcal{EO}}}$(n) denotes the number of partitions enumerated by ����(n) in which only the largest even part appears an odd number of times. In this paper we obtain some congruences modulo 2, 4, 10 and 20 for the partition function ${\bar{\mathcal{EO}}}$(n). We give a simple proof of the first Ramanujan-type congruences ${\bar{\mathcal{EO}}}$ (10n + 8) ≡ 0 (mod 5) given by Andrews.

라운드-로빈 홈 앤드 어웨이 스포츠 리그 대진표 작성 정규형 라틴 방진 알고리즘 (Canonical Latin Square Algorithm for Round-Robin Home-and-Away Sports Leagues Scheduling)

  • 이상운
    • 한국인터넷방송통신학회논문지
    • /
    • 제18권4호
    • /
    • pp.177-182
    • /
    • 2018
  • 최소 제동 수를 갖는 홈 앤드 어웨이 라운드-로빈 경기일정 대진표를 작성하는 문제는 매우 어려워 NP-난제로 알려져 있다. 본 논문에서는 임의의 팀 수 n에 대해서도 항상 동일한 패턴으로 경기일정 대진표를 O(n) 수행 복잡도로 컴퓨터 프로그램 도움 없이 직접 손으로 작성할 수 있는 알고리즘을 제안하였다. 제안된 알고리즘은 n=even 팀에 대해 $n{\times}n$ 정규형 라틴 방진을 작성하여 대진표를 작성하고, 최소 제동 수가 n-2 가 되도록 홈-어웨이를 배정하였다. 또한, n=odd에 대해서는 n=even 결과에서 최대 제동 수를 갖는 n번째 팀을 삭제하는 방법으로 제동이 전혀 없는 대진표를 작성하였다.

MOEPE: 스테레오 정합 하드웨어를 위한 Merged Odd-Even PE구조 (MOEPE: Merged Odd-Even PE Architecture for Stereo Matching Hardware)

  • 한필우;양영일
    • 대한전자공학회논문지SD
    • /
    • 제37권10호
    • /
    • pp.57-64
    • /
    • 2000
  • 본 논문에서는 동적 프로그래밍에 기반한 스테레오 정합 알고리듬을 구현하는 새로운 하드웨어 구조를 제안하였다. 제안된 MOEPE(Merged Odd-Even PE) 구조는 시스톨릭 방법으로 동작하고, 극상선상의 화소의 밝기 값으로부터 변이를 찾는다. MOEPE구조에서 사용된 PE 수는 변이제약조건의 수와 일치하는데, 이는 극상선상의 화소 수만큼의 PE를 사용하는 기존의 방법에 비하여 훨씬 적은 수의 PE를 사용한다. MOEPE 구조에서 사용된 PE 수는 일반적 크기의 영상에 대하여, 기존의 방법에 비하여 약 25배 적은 수의 PE를 사용한다. 제안된 구조는 VHDL로 기술하였고, Synopsys 설계 환경에서 시뮬레이션을 수행하였다.

  • PDF