Abstract

An integer n is said to be y-friable if its largest prime factor P(n) does not exceed y. By convention, P(1)≔ 1. Classical notations are S(x, y) ≔ {n ≦ x : P(n) ≦ y} for the set of y-friable integers not exceeding x and Ψ(x, y) for its cardinality.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call