document.write( "Question 592549: the sum of the digits of a two-digit prime number is subtracted from the number. Prove that the difference cannot be a prime nuber. \n" ); document.write( "
Algebra.Com's Answer #375991 by solver91311(24713)\"\" \"About 
You can put this solution on YOUR website!
\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The fact that the original number is prime is just a red herring. In fact, if you subtract the sum of the digits from any integer, the result is divisible by 9 and therefore not prime.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Proof for two-digit integers:\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Let represent the 10s digit and let represent the 1s digit.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Then the original integer is and the sum of the digits is .\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Subtracting:\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Which is divisible by 9. So if ANY two digit integer less the sum of its digits is non-prime, any prime two digit integer must exhibit the same characteristic.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Q.E.D.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "John
\n" ); document.write( "
\n" ); document.write( "My calculator said it, I believe it, that settles it
\n" ); document.write( "
\"The

\n" ); document.write( "
\n" ); document.write( "
\n" );