maths.free › Number Theory › Divisors

Divisors

Counting and listing divisors from the prime factorisation.

If n = p₁ᵃ · p₂ᵇ · …, then every divisor picks an exponent between 0 and a for p₁, between 0 and b for p₂, and so on, which is why the number of divisors is (a+1)(b+1)…. Perfect squares are exactly the numbers with an odd count.

Contoh soal · divisors of 36

Number-Theory · Divisors

Divisors of 36

36

Langkah demi langkah

  1. 36 = 2^{2} \times 3^{2}

    Prime-factorise first.

  2. d(n) = (2+1) \cdot (2+1) = 9

    Each divisor picks an exponent from 0 up to the prime's exponent, so multiply (exponent + 1) for each prime.

  3. 1, 2, 3, 4, 6, 9, 12, 18, 36

    List them in increasing order.

Tampilkan jawaban
1, 2, 3, 4, 6, 9, 12, 18, 36

Sekarang Anda Pilih soal, atau ketik atau gambar soal Anda sendiri. Setiap langkah, sebuah gambar, jawabannya tersembunyi sampai Anda memintanya.

Simpan pekerjaan Anda sendiri

Sebuah akun gratis menambahkan catatan pada setiap pelajaran, catatan apa yang telah Anda selesaikan, masalah yang Anda selesaikan di satu tempat, dan tutor yang dapat Anda tanyakan tentang halaman ini. matematika itu sendiri terbuka untuk semua orang, ditandatangani atau tidak.

Daftar Masuk

Simbol yang digunakan di sini

Sentuh simbol apapun untuk definisi lengkap, gambar, dan apa setiap huruf di dalamnya berarti.

Bagaimana: Divisors

  1. Prime-factorise first.
  2. Each divisor picks an exponent from 0 up to the prime's exponent, so multiply (exponent + 1) for each prime.
  3. List them in increasing order.

Pertanyaan yang sering diajukan

Why are primes so important?

Every integer factors into primes in exactly one way, so primes are the atoms of multiplication. Cryptography relies on that factoring being easy to state and hard to do.

How do I tell whether a big number is prime?

Trial division up to the square root works for small numbers. For large ones, probabilistic tests (Miller-Rabin) give an answer that is wrong with negligible probability, and deterministic tests (AKS) exist but are slower.

Lainnya di Number Theory

Prime factorisationPrime numbersGCD and LCMModular arithmeticSequencesNumber basesDiophantine equationsFermat's little theorem and Euler's theoremRSA: cryptography from number theory