Skip to main content
Mathematics LibreTexts

2.2: Order and factors

  • Page ID
    23444
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    Problem 44 Find the remainder when we divide

    1111 · · · 1111 (with 1111 digits 1)

    by 1111.

    Problem 45 Which of the numbers

    Screen Shot 2021-08-06 at 1.16.08 PM.png

    is bigger?

    Problem 46 Show that the integer

    100 000 000 003 000 000 000 000 700 000 000 021

    is not prime.

    Problem 47 How many prime numbers are there in each of these sequences? (Can you identify infinitely many primes in either sequence? Can you identify infinitely many non-primes?)

    (a) 1, 11, 111, 1111, 11111, 111111, 1111111, ...

    (b) 11, 1001, 100001, 10000001, ...


    This page titled 2.2: Order and factors is shared under a CC BY 4.0 license and was authored, remixed, and/or curated by Alexandre Borovik & Tony Gardiner (Open Book Publishers) via source content that was edited to the style and standards of the LibreTexts platform; a detailed edit history is available upon request.