A near-repunit is an integer kRn that has n - 1 digits equal to 1, and one 0 in the k +

Chapter 16, Problem 48

(choose chapter or problem)

A near-repunit is an integer kRn that has n - 1 digits equal to 1, and one 0 in the k + 1 'stplace from the right; that is,kRn = Rn-k-1 lOk+l + Rk = 111 ... 11011 ... 111Show that if gcd(n - 1, 3k) > 1, then k Rn is composite

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