A prime power is a positive integer of the form pd, where p is a prime number and d is a nonnegative integer.
Ancestors (5)
Incoming links (67)
- abc conjecture
- Carmichael function
- Chebyshev function
- Consecutive integers divisible by prescribed prime powers
- Coprime-factorization lower bound for a quadratic-form class number
- Coresilience
- Divisor-square summatory bound
- Divisor sum
- Elementary lower bound for the Chebyshev theta function
- Euler totient function
- Finite field
- Gaussian binomial coefficient
- Gaussian binomial coefficient counts finite-field subspaces
- Gaussian multinomial coefficient
- Greatest common unitary divisor
- Hensel lifting
- Idempotent residue
- Inverse totient problem
- Lifting a primitive root to odd prime powers
- Min_25 sieve
- Möbius function
- Multiplicative function
- Multiplicativity of an arithmetic function
- Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 25 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 25 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 22 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 28 / 3 / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 28 / 7 / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 28 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 28 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2010 / iii / Paper 25 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2010 / iii / Paper 25 / 5 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 29 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 23 / 4 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 27 / 4 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 124 / 1 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 124 / 3 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / ii / Paper 3 / 17G / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 150 / 1 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2021 / iii / Paper 150 / 4 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2021 / ii / Paper 2 / 1I / Solution
- Past exam of the mathematics course of the University of Cambridge / 2022 / ia / Paper 4 / 5E / Solution
- Past exam of the mathematics course of the University of Cambridge / 2022 / ib / Paper 2 / 9E / Solution
- Past exam of the mathematics course of the University of Cambridge / 2022 / ii / Paper 2 / 20H / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 160 / 2 / b / Solution
- Past exam of the mathematics course of the University of Oxford / 2017 / Prelims / Mathematics I / 5 / c / Solution
- Past exam of the number theory course of the University of Oxford / 2008 / B / 7 / Solution
- Past exam of the number theory course of the University of Oxford / 2009 / B / 6 / Solution
- Past exam of the options II course of the University of Oxford / 2005 / C / 2 / a / i / Solution
- Past exam of the short options course of the University of Oxford / 2017 / 1 / d / Solution
- Past exam of the short options course of the University of Oxford / 2017 / 2 / a / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming (resit) / 1 / e / Solution
- Perfection quotient
- Pollard's p-1 algorithm
- Prime-power characterization by full permutation cycles
- Prime-restriction metric for pretentious distance
- Prime-to-residue-characteristic multiplication on a formal group
- Principal-unit group of a mixed-characteristic local field
- Second Chebyshev function
- Sum-of-divisors function
- Sum of two squares theorem
- Total number of prime factors
- Trial division
- Trial-division divisor counting
- Unitary divisor
- Von Mangoldt divisor identity
- Von Mangoldt function
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (2)
A **prime power** is a number that can be expressed in the form \( p^k \), where \( p \) is a prime number and \( k \) is a positive integer. In other words, a prime power is a number that results from raising a prime number to an integer exponent greater than zero.