Elementary Number Theory Problems 3.3 Solution (David M. Burton's 7th Edition) - Q11

My Solution for "Find the smallest positive integer $n$ for which the function $f(n) = n^2 + n + 17$ is composite. Do the same for the functions $g(n) = n^2 + 21n + 1$ and $h(n) = 3n^2 + 3n + 23$."

Ran
Ran

Table of Contents


Background

All theorems, corollaries, and definitions listed in the book's order:

Theorems and Corollaries in Elementary Number Theory (Ch 1 - 3)
All theorems and corollaries mentioned in David M. Burton’s Elementary Number Theory are listed by following the book’s order. (7th Edition) (Currently Ch 1 - 3)
RanblogRan

I will only use theorems or facts that are proved before this question. So you will not see that I quote theorems or facts from the later chapters.

Question

Find the smallest positive integer $n$ for which the function $f(n) = n^2 + n + 17$ is composite. Do the same for the functions $g(n) = n^2 + 21n + 1$ and $h(n) = 3n^2 + 3n + 23$.

Solution

(I wrote a program for this question.)

When $n = 16$, $f(16) = 289$ appears to be the smallest composite.

When $n = 18$, $g(n) = 703$ appears to be the smallest composite.

When $n = 22$, $h(n) = 1541$ appears to be the smallest composite.

Read More: All My Solutions for This Book

< Chapter 3.3, Q10 Chapter 3.3, Q12 >

MathNumber TheorySolution
Ran

Ran

Comments

You might also like

Elementary Number Theory Problems 4.3 Solution (David M. Burton's 7th Edition) - Q10 Members Public

My Solution for "Prove that no integer whose digits add up to $15$ can be a square or a cube. [Hint: For any $a$, $a^{3} \equiv 0$, $1$, or $8$ $\pmod 9$.]"

Ran
Ran
Math

Elementary Number Theory Problems 4.3 Solution (David M. Burton's 7th Edition) - Q9 Members Public

My Solution for "Find the remainder when $4444^{4444}$ is divided by $9$. [Hint: Observe that $2^{3} \equiv -1 \pmod {9}$.]"

Ran
Ran
Math