A Test for Divisibility by Primes
Stanley J. Bezuszka
Abstract
Stanley J. Bezuszka
Abstract
Many people a re interested in divisibility rules, particularly since they can be coordinated with calculator activities. For example, young student can use calculator to gather data, examine the data for patterns, and discover some divisibility rules on their own. (See Bitter and Mikesell 1980; Rey et al. 1979.) Generally, calculator afford a quick way to determine if a number is divisible by a certain prime. Divisibility rules are particlarly useful when the number being tested for divisibility is too large for a calculator to handle exactly.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Many people a re interested in divisibility rules, particularly since they can be coordinated with calculator activities. For example, young student can use calculator to gather data, examine the data for patterns, and discover some divisibility rules on their own. (See Bitter and Mikesell 1980; Rey et al. 1979.) Generally, calculator afford a quick way to determine if a number is divisible by a certain prime. Divisibility rules are particlarly useful when the number being tested for divisibility is too large for a calculator to handle exactly.
Key concepts: Divisibility rule, Calculator, Prime (order theory), Arithmetic, Computer science, Test (biology), Mathematics, Mathematics education