for which the function is composite.
Find the smallest positive integer
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I got the idea from Barry Cipra .
Because 3 n 2 + 3 n + 2 3 = 3 n ( n + 1 ) + 2 3 is divisible by 2 3 when n = 2 2 , the upper bound of the answer is 2 2 . And I'm going to prove that n = 2 2 is the solution by showing that no smaller values of n satisfy the condition.
Since 1 2 ( 3 n 2 + 3 n + 2 3 ) = ( 6 n + 3 ) 2 + 2 6 7 , we just need to show that − 2 6 7 is a quadratic non-residue mod odd primes less than 2 3 but bigger than 3 . A trivial substitution of n = 3 shows that it's prime.
If p ∣ 3 n 2 + 3 n + 2 3 , then ( 6 n + 3 ) 2 + 2 6 7 ≡ 0 ( m o d p ) , which means that − 2 6 7 is a square modulo p . When n = 2 3 , 3 n 2 + 3 n + 2 3 = 1 6 7 9 , so if any of them were composite, it would have a prime factor less than 1 6 7 9 ≈ 4 0 . 9 7 .
That prime factor would have to be odd, since it's clear that 3 n 2 + 3 n + 2 3 is always odd, this would require − 2 6 7 to be a quadratic residue for some odd prime less than 4 0 but bigger than n = 3 . So it suffices to compute the Legendre symbol ( p − 2 6 7 ) for p = 5 , 7 , 1 1 , 1 3 , 1 7 , 1 9 , 2 3 , 2 9 , 3 1 , 3 7 and show that it's − 1 for all cases.
With the help of law of quadratic reciprocity.
when p = 5 , ( 5 − 2 6 7 ) ≡ ( 5 3 ) ≡ 3 2 5 − 1 ≡ − 1 .
when p = 7 , ( 7 − 2 6 7 ) ≡ ( 7 − 1 ) ≡ − 1 .
when p = 1 1 , ( 1 1 − 2 6 7 ) ≡ ( 1 1 − 3 ) ≡ − ( 1 1 3 ) ≡ ( 3 1 1 ) ≡ ( 3 − 1 ) ≡ − 1 .
when p = 1 3 , ( 1 3 − 2 6 7 ) ≡ ( 1 3 − 7 ) ≡ − ( 1 3 7 ) ≡ − ( 7 1 3 ) ≡ − ( 7 1 ) ≡ − 1 .
when p = 1 7 , ( 1 7 − 2 6 7 ) ≡ ( 1 7 − 1 2 ) ≡ ( 1 7 5 ) ≡ ( 5 1 7 ) ≡ ( 5 2 ) ≡ 2 2 4 ≡ − 1 .
when p = 1 9 , ( 1 9 − 2 6 7 ) ≡ ( 1 9 − 1 ) ≡ ( − 1 ) 2 1 9 − 1 ≡ − 1 .
when p = 2 3 , ( 2 3 − 2 6 7 ) ≡ ( 2 3 − 6 ) ≡ ( 2 3 1 7 ) ≡ ( 1 7 2 3 ) ≡ ( 1 7 6 ) ≡ 6 8 ≡ 2 4 ≡ − 1 .
when p = 2 9 , ( 2 9 − 2 6 7 ) ≡ − ( 2 9 2 3 ) ≡ 2 3 1 4 ≡ − 2 3 1 4 ≡ − 6 1 4 ≡ − 7 7 ≡ − 1 .
when p = 3 1 , ( 3 1 − 2 6 7 ) ≡ ( 3 1 1 2 ) ≡ ( 3 1 3 ) ≡ − ( 3 3 1 ) ≡ − 1 .
when p = 3 7 , ( 3 7 − 2 6 7 ) ≡ − ( 3 7 8 ) ≡ ( 3 7 2 9 ) ≡ ( 2 9 3 7 ) ≡ ( 2 9 8 ) ≡ ( 2 9 2 ) ≡ 2 1 4 ≡ 3 2 ⋅ 1 6 ≡ − 1 .
Hence, we have shown that no prime numbers less than 4 0 divide the expression, thus 2 2 is the smallest such integer.