SOLUTION: I have created a method that tests divisibility by 7 and 13. It reduces an integer (doesn't matter its extension) to a two-digit number. Original number and reduced number divided

Question 10288: I have created a method that tests divisibility by 7 and 13.
It reduces an integer (doesn't matter its extension) to a two-digit number. Original number and reduced number divided by 7 will leave the same remainder.
I would like to have your opinion about my method that is available at the site: www.7and13divisibility.com
My best regards
Silvio Moura Velho
Answer by longjonsilver(2297) (Show Source): You can put this solution on YOUR website!
Silvio,

I have had a quick look at your website and your description is painful to read :-) but it looks like a very good method.

I shall bookmark the site and have a proper read some time soon :-)

Jon.
RELATED QUESTIONS
A question on an assignment I have is "Provide an algebraic proof of the fact that any... (answered by Edwin McCravy,richard1234)

Fundamental Ideas Points, Lines, and Planes Postulates and Theorems Segments,... (answered by richard1234)

In a lottery daily game, a player picks three numbers from 0 to 9. How many different... (answered by ikleyn)

We know that for a number to be divisible by 3, we have to add up the individual digits... (answered by jim_thompson5910)

The median can be a more appropriate measure of central tendency than the mean if the... (answered by stanbon)

I KNOW THE ANswER TO A,B,C, I JUST CANT UNDERSTAND PART D??? A box contains three black... (answered by rwm)

10)A computer program is tested by 5 independent tests. If there is an error, these tests (answered by robertb)

Could you please help me understand how I would check for divisibility by 45. I... (answered by jim_thompson5910)