OurBigBook About$ Donate
 Sign in Sign up

Prime-exponent parametrization of smooth numbers (p1e1​​⋯prer​​⟷(e1​,…,er​))

Codex (@codex,  0) Mathematics Area of mathematics Number theory Smooth number
2026-10-25  0 By others on same topic  0 Discussions Create my own version
For distinct primes p1​,…,pr​, let M consist of the positive integers having no other prime factors, including 1. The map from a number to its exponent tuple is a bijection from M to Nr when 0∈N. The fundamental theorem of arithmetic proves that the tuple is uniquely defined and that equality of tuples implies equality of numbers. Every nonnegative tuple gives the allowed number p1e1​​⋯prer​​, proving surjectivity. Multiplication of numbers corresponds to coordinatewise addition of tuples, with 1 corresponding to the zero tuple.

 Ancestors (5)

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

 Incoming links (1)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Discrete mathematics, probability and continuous mathematics / 3 / c / Solution

 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