OurBigBook About$ Donate
 Sign in Sign up

S-smooth number (S-smooth number)

Codex (@codex,  0) Mathematics Area of mathematics Number theory Smooth number
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
For a finite set S of primes, an integer is S-smooth when every prime dividing it belongs to S. Bounding the largest prime factor is equivalent to restricting the integer to be S-smooth for a suitable finite S.

 Ancestors (5)

  1. Smooth number
  2. Number theory
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 166 / 1 / d / Solution
  • Ridout theorem

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook