How to make the Tau function odd

  • Thread starter Thread starter napoleon67
  • Start date Start date
  • Tags Tags
    Function
Click For Summary

Homework Help Overview

The discussion revolves around the conditions under which the Tau function, which counts the number of divisors of a number \( n \), is odd. Participants explore the implications of \( n \) being a perfect square and the relationship between the exponents in its prime factorization.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the implications of \( n \) being prime or a perfect square on the oddness of the Tau function. There are attempts to clarify definitions and conditions related to the exponents in the prime factorization of \( n \).

Discussion Status

The discussion is active, with participants questioning and clarifying the conditions for the Tau function to be odd. Some suggest that \( T(n) \) is odd if and only if \( n \) is a perfect square, while others are working on proofs or conjectures related to this assertion.

Contextual Notes

There is some confusion regarding the definitions and implications of the conditions discussed, particularly concerning the relationship between the exponents in the prime factorization and the oddness of the Tau function.

napoleon67
Messages
6
Reaction score
0

Homework Statement


What are the necessary conditions on n for T(n) {the Tau function} to be odd.

Homework Equations


Tau function counts the number of divisors of n
T(1) = 1, T(p) = 2, and T(p^k) = k + 1

The Attempt at a Solution


I have that n cannot be prime, also if n = p^k then k must be even or of the from k = 2c for some c > 0.

I cannot figure out how to describe evens with were are multiple primes such as 1x3x7x8 = 231. That number has an even number of divisors but I'm and lost at how to prevent that.
 
Last edited:
Physics news on Phys.org
I don't understand why k is even OR k=2c. Those are identical conditions...What is T(xy) for x,y coprime?
 
I meant k is even i.e k =2c... I was just adding more definition.

T(xy) for x,y is coprime is an even number of divisors. Thanks.
 
napoleon67 said:
I meant k is even i.e k =2c... I was just adding more definition.

T(xy) for x,y is coprime is an even number of divisors. Thanks.
No, that's not right.
 
T(xy) for x,y is coprime means T(x)T(y)
 
Is is sufficient to say that T(n) is only odd when n is a perfect square?
 
T(n) is odd if and only if n is a perfect square. Can you prove it?
 
I was just supposed to make a conjecture, but I'll try to work on a proof
 
Assume that n is an odd tau number. Let n = p^a1*p^a2...* p^ak. By the definition of tau number (a1 + 1)(a2 + 1)(a3 + 1)... (ak + 1) | n. Therefore for any 0 < i < k + 1, ai + 1 is odd, and hence ai is even. Since every prime in the factorization of n is raised to an even power, n is a perfect square.
 
  • #10
napoleon67 said:
Assume that n is an odd tau number. Let n = p^a1*p^a2...* p^ak. By the definition of tau number (a1 + 1)(a2 + 1)(a3 + 1)... (ak + 1) | n.
What you meant to say was

[tex](a_1 + 1)(a_2 + 1)(a_3 + 1)\dots (a_k + 1) = \tau (n)[/tex]

not

[tex](a_1 + 1)(a_2 + 1)(a_3 + 1)\dots (a_k + 1) | n[/tex]
Therefore for any 0 < i < k + 1, ai + 1 is odd, and hence ai is even. Since every prime in the factorization of n is raised to an even power, n is a perfect square.
The question only asked you to find a necessary condition, and you've done this. But the stuff you've said above goes both ways, so it's actually a sufficient condition as well.
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 19 ·
Replies
19
Views
5K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
3
Views
2K
Replies
9
Views
3K