document.write( "Question 1150730: Let f(x) = x^2 + x + 2. How many integers s are there so that 1 ≤ s ≤ 99 and f(s) has remainder 1 when divided by 6? \n" ); document.write( "

Algebra.Com's Answer #772140 by ikleyn(52782) $\"\"$ $\"About$

You can put this solution on YOUR website!
.
\n" ); document.write( "

\r\n" );
document.write( "\r\n" );
document.write( "If x = 1 mod 6 then  (x^2 + x + 2) mod 6 = (1 + 1 + 2)  mod 6 =  4 mod 6;\r\n" );
document.write( "\r\n" );
document.write( "If x = 2 mod 6 then  (2^2 + 2 + 2) mod 6 = (4 + 2 + 2)  mod 6 =  8 mod 6 = 2 mod 6;\r\n" );
document.write( "\r\n" );
document.write( "If x = 3 mod 6 then  (3^2 + 3 + 2) mod 6 = (9 + 3 + 2)  mod 6 = 14 mod 6 = 2 mod 6;\r\n" );
document.write( "\r\n" );
document.write( "If x = 4 mod 6 then  (4^2 + 2 + 2) mod 6 = (16 + 4 + 2) mod 6 = 22 mod 6 = 4 mod 6;\r\n" );
document.write( "\r\n" );
document.write( "If x = 5 mod 6 then  (5^2 + 2 + 2) mod 6 = (25 + 5 + 2) mod 6 = 32 mod 6 = 2 mod 6;\r\n" );
document.write( "\r\n" );
document.write( "If x = 6 mod 6 then  (6^2 + 2 + 2) mod 6 = (36 + 6 + 2) mod 6 = 44 mod 6 = 2 mod 6.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Thus,  x^2 + x + 2  NEVER gives the remainder of 1 when divided by 6 for ALL integer x.    ANSWER\r\n" );
document.write( "

\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Solved, answered, explained and completed.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "

\n" );