Divisibility by primes

Nair, Vinay (2017) Divisibility by primes. At Right Angles, 6 (2). pp. 63-66. ISSN 2582-1873

Text - Published Version
Download (307kB) | Preview


I n school we generally study divisibility by divisors from 2 to 12 (except 7 in some syllabi). In the case of composite divisors beyond 12, all we need to do is express the divisor as a product of coprime factors and then check divisibility by each of those factors. For example, take the case of 20; since 20 = 4 × 5 (note that 4 and 5 are coprime), it follows that a number is divisible by 20 if and only if it is divisible by 4 as well as 5. It is crucial that the factors are coprime. For example, though 10 × 2 = 20, since 10 and 2 are not coprime, it cannot be asserted that if a number is divisible by both 10 and 2, then it will be divisible by 20 as well. You should be able to find a counterexample to this statement. Divisibility tests by primes such as 7, 13, 17 and 19 are not generally discussed in the school curriculum. However, in Vedic Mathematics (also known by the name “High Speed Mathematics”; see Box 1), techniques for testing divisibility by such primes are discussed, but without giving any proofs. In this article, proofs of these techniques are discussed.

Item Type: Articles in APF Magazines
Authors: Nair, Vinay
Document Language:
Uncontrolled Keywords: Divisibility, Divisor, Osculator, Vedic mathematics
Subjects: Natural Sciences
Natural Sciences > Mathematics
Divisions: Azim Premji University > University Publications > At Right Angles
Full Text Status: Public
URI: http://publications.azimpremjiuniversity.edu.in/id/eprint/1342
Publisher URL: http://apfstatic.s3.ap-south-1.amazonaws.com/s3fs-...

Actions (login required)

View Item View Item