A positive integer is semidivisible when it lies strictly between the squares of consecutive prime numbers ,and is divisible by exactly one of and . The strict inequalities exclude both endpoint squares. For example, is semidivisible because and only divides . The integer lies in the same band but is divisible by both prime numbers, so it is excluded.
Within one band, a divisibility calculation can avoid testing every integer. Add the sums of integer multiples of and of , then subtract twice the sum of integer multiples of . Each doubly divisible number was counted twice and should count zero times. Each sum is an arithmetic progression, and the same inclusion-exclusion bookkeeping works for counts instead of sums.
Articles by others on the same topic
There are currently no matching articles.