Can I read Infinitely Many n in Number Theory Problems on EtoBox?

Infinitely Many n in Number Theory Problems by Ajay Negi is a document available to read on EtoBox.

What is Infinitely Many n in Number Theory Problems about?

Problem 4 asks to prove that there are infinitely many positive integers n such that 2^n + 1 + 1 is divisible by n but 2n + 1 is not. Problem 5 asks to color each cell of an n x n square array with at least b(n+2)^2/3c colors such that there is a 1 x 3 or 3 x 1 subarray with three different colors. Problem 6 asks to prove that the lines AA

Author

Ajay Negi

Language

EN