Show that there are infinitely many integers n for which <f>(n) is a perfect

Chapter 7, Problem 6

(choose chapter or problem)

Show that there are infinitely many integers n for which (n) is a perfect square.[Hint: Consider the integers n = 22k+1 fork= 1, 2, .... ]

Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.

Becoming a subscriber
Or look for another answer

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back