Inference of even or odd from the number of divisors?

  • Thread starter Thread starter MathematicalPhysicist
  • Start date Start date
  • Tags Tags
    even
MathematicalPhysicist
Science Advisor
Gold Member
Messages
4,662
Reaction score
372
is there some theorem of some sort, that connect the number of divisors of a number to identify if it's even or odd?

or to be more specific, does number of divisors of a number has any significance in number theory?
 
Physics news on Phys.org
loop quantum gravity said:
is there some theorem of some sort, that connect the number of divisors of a number to identify if it's even or odd?

No. Number of divisors depends only on the exponents in the prime factorization of a number, it doesn't care what these primes are.

Determining if a number is even is not generally a difficult thing to do at any rate.

loop quantum gravity said:
ior to be more specific, does number of divisors of a number has any significance in number theory?

Yes, the number of divisors function and many variants are studied extensively.
 
Yes, the number of divisors function and many variants are studied extensively.
what examples of number of divisors function can you give?
 
The basic one counts the number of ways to write n as a product of 2 numbers, you can consider number of ways to write it as a product of k numbers. You can also consider the sum of the divisors, sum of squares of the divisors, etc.
 
lqg, look up the following :

number theoretic functions, the tau function, the divisor function - Mathworld is one place to start

Note : The number of divisors can tell you whether or not a number is a perfect square
 
Last edited:
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top