SOME ADDITIONAL FACTORIZATIONS OF 2N +- 1

被引：0
|
作者：
ISEMONGER, KR
机构：
来源：
MATHEMATICS OF COMPUTATION | 1965年 / 19卷 / 89期
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：145 / +
页数：1
相关论文
共 50 条
  • [1] Indecomposable 1-factorizations of the complete multigraph λK2n for every λ ≤ 2n
    Bonvicini, S.
    Rinaldi, G.
    [J]. JOURNAL OF COMBINATORIAL DESIGNS, 2018, 26 (01) : 12 - 26
  • [2] ALMOST PERFECT ONE-FACTORIZATIONS OF K2N (2N + 1 PRIME)
    MENDELSOHN, E
    [J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 22 (02): : A299 - A299
  • [3] SOME FACTORIZATIONS OF 2N+-1 AND RELATED RESULTS
    BRILLHART, J
    SELFRIDG.JL
    [J]. MATHEMATICS OF COMPUTATION, 1967, 21 (97) : 87 - +
  • [4] An improved RNS-to-binary converter for 7-modulus set {2n–5–1, 2n–3–1, 2n–2+1, 2n–1–1, 2n–1+1, 2n, 2n+1} for n even
    M V N Madhavi Latha
    Rashmi Ramesh Rachh
    P V Ananda Mohan
    [J]. Sādhanā, 2020, 45
  • [5] AN RNS TO BINARY CONVERTER IN 2N + 1, 2N, 2N - 1 MODULI SET
    PREMKUMAR, AB
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 1992, 39 (07): : 480 - 482
  • [6] (2n, 2n, 2n, 1)-Relative Difference Sets and Their Representations
    Zhou, Yue
    [J]. JOURNAL OF COMBINATORIAL DESIGNS, 2013, 21 (12) : 563 - 584
  • [7] High Precision Multiplier for RNS {2n - 1, 2n, 2n
    Ma, Shang
    Hu, Shuai
    Yang, Zeguo
    Wang, Xuesi
    Liu, Meiqing
    Hu, Jianhao
    [J]. ELECTRONICS, 2021, 10 (09)
  • [8] A NOTE ON THE PRIMALITY OF 6(2N) + 1 AND 10(2N) + 1
    WILLIAMS, HC
    [J]. FIBONACCI QUARTERLY, 1988, 26 (04): : 296 - 305
  • [9] Efficient VLSI Implementation of 2n Scaling of Signed Integer in RNS {2n - 1, 2n, 2n + 1} (vol 21, pg 1936, 2013)
    Tay, Thian Fatt
    Chang, Chip-Hong
    Low, Jeremy Yung Shern
    [J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2016, 24 (04) : 1612 - 1612
  • [10] On some n-forms in dimension 2n
    Turiel, FJ
    [J]. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 2001, 333 (05): : 471 - 474
12345