mod function and division

From: dahlia (beta_at_gamma.com)
Date: 03/30/04 

Date: Mon, 29 Mar 2004 18:23:49 -0500

a simple question for this illustrious group:

what is the fastest way ( algorithm ) to find out if big numbers( hundred
of digits ) N(i) are divisible by a small number below 100 ( say 37 )? do
we do the divisions or do we use the mod function?

thanks