Integer

Results: 2878



#Item
21 Tuesday Daily Gather: Fibonacci. by Brian Jonah Brian’s brother has a favorite positive integer n, and he wants to find a Fibonacci number Fk such that n | Fk . Obviously, the trivial case F0 = 0 = n · 0 satisfies th

Tuesday Daily Gather: Fibonacci. by Brian Jonah Brian’s brother has a favorite positive integer n, and he wants to find a Fibonacci number Fk such that n | Fk . Obviously, the trivial case F0 = 0 = n · 0 satisfies th

Add to Reading List

Source URL: www.mathily.org

Language: English - Date: 2017-12-18 16:01:05
    22Annals of Mathematics, ), 547–565 On the complexity of algebraic numbers I. Expansions in integer bases By Boris Adamczewski and Yann Bugeaud

    Annals of Mathematics, ), 547–565 On the complexity of algebraic numbers I. Expansions in integer bases By Boris Adamczewski and Yann Bugeaud

    Add to Reading List

    Source URL: math.univ-lyon1.fr

    Language: English - Date: 2007-11-07 04:25:08
      23Integer Linear Programming (ILP)

      Integer Linear Programming (ILP)

      Add to Reading List

      Source URL: rtime.felk.cvut.cz

      Language: English - Date: 2018-04-09 14:05:42
        24CHMMC 2015 Tiebreaker Problems November 22, 2015 Problem 0.1. Call a positive integer x n-cube-invariant if the last n digits of x are equal to the last n digits of x3 . For example, 1 is n-cube invariant for any integer

        CHMMC 2015 Tiebreaker Problems November 22, 2015 Problem 0.1. Call a positive integer x n-cube-invariant if the last n digits of x are equal to the last n digits of x3 . For example, 1 is n-cube invariant for any integer

        Add to Reading List

        Source URL: chmmc.caltech.edu

        - Date: 2015-11-27 22:57:07
          25Formal Verification of Integer Multipliers by Combining Gr¨obner Basis with Logic Reduction Amr Sayed-Ahmed1 Daniel Große1,2

          Formal Verification of Integer Multipliers by Combining Gr¨obner Basis with Logic Reduction Amr Sayed-Ahmed1 Daniel Große1,2

          Add to Reading List

          Source URL: www.informatik.uni-bremen.de

          Language: English - Date: 2015-11-27 04:27:46
            26QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday September 1, 2015 (DayA) The integer 8871870642308873326043363 is the 13th power of an integer

            QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday September 1, 2015 (DayA) The integer 8871870642308873326043363 is the 13th power of an integer

            Add to Reading List

            Source URL: www.math.harvard.edu

            Language: English - Date: 2016-02-04 13:16:56
              27The Speakers Jawad Elomari he is a lead researcher at ORTEC B.V. on mixed integer nonlinear optimization. He has worked in various industries like supply chain, pharmaceuticals, and engineering design. His research inter

              The Speakers Jawad Elomari he is a lead researcher at ORTEC B.V. on mixed integer nonlinear optimization. He has worked in various industries like supply chain, pharmaceuticals, and engineering design. His research inter

              Add to Reading List

              Source URL: or2015.univie.ac.at

              Language: English - Date: 2015-07-09 02:39:51
                28GREEDY LATTICE ANIMALS: GEOMETRY AND CRITICALITY ALAN HAMMOND Abstract. Assign to each site of the integer lattice Zd a real score, sampled according to the same distribution F , independently of the choices made at all

                GREEDY LATTICE ANIMALS: GEOMETRY AND CRITICALITY ALAN HAMMOND Abstract. Assign to each site of the integer lattice Zd a real score, sampled according to the same distribution F , independently of the choices made at all

                Add to Reading List

                Source URL: www.stats.ox.ac.uk

                Language: English - Date: 2009-10-10 02:36:44
                  29THE f (q) MOCK THETA FUNCTION CONJECTURE AND PARTITION RANKS KATHRIN BRINGMANN AND KEN ONO Abstract. In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtai

                  THE f (q) MOCK THETA FUNCTION CONJECTURE AND PARTITION RANKS KATHRIN BRINGMANN AND KEN ONO Abstract. In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtai

                  Add to Reading List

                  Source URL: www.mathcs.emory.edu

                  Language: English - Date: 2010-08-24 14:06:47
                    30Efficient Integer Vector Homomorphic Encryption Angel Yu, Wai Lok Lai, James Payor Massachusetts Institute of Technology 77 Massachusetts Avenue, Cambridge, MA 02139, USA {angelyu, wllai, payor}@mit.edu

                    Efficient Integer Vector Homomorphic Encryption Angel Yu, Wai Lok Lai, James Payor Massachusetts Institute of Technology 77 Massachusetts Avenue, Cambridge, MA 02139, USA {angelyu, wllai, payor}@mit.edu

                    Add to Reading List

                    Source URL: courses.csail.mit.edu

                    Language: English