MHB Smallest K in N with 32 Divisors

  • Thread starter Thread starter mathworker
  • Start date Start date
AI Thread Summary
The discussion focuses on finding the smallest integer \( N \) that has exactly 32 divisors, where \( N \) is expressed as a product of distinct prime factors. Participants confirm that the primes \( P_1, P_2, \ldots \) are indeed distinct, as indicated by the condition \( P_i = P_j \iff i = j \). The problem emphasizes the relationship between the number of divisors and the prime factorization of \( N \). The conversation highlights the importance of understanding divisor functions in relation to prime numbers. Ultimately, the goal is to determine the minimum value of \( N \) that meets the specified criteria.
mathworker
Messages
110
Reaction score
0
Let $$N$$ be a set such that $$K \text{ belongs to }N$$ iff $$K=P_1P_2...P_n$$ such that $$P_i=P_j \text{ iff }i=j$$ find a smallest K in N such that number of divisors of K=32
edit:sorry for using same variable in two places.k is changed to n
 
Last edited:
Mathematics news on Phys.org
Re: divisors problem

Hint:
though backstabing humans is not allowed backstabing problems is allowed.
To find the smallest begin from the smallest
 
Re: divisors problem

Just to check, $P_1, P_2, \cdots$ are meant to be prime, right? (I think so because of the $P_i = P_j ~ ~ \iff ~ ~ i = j$ part).

If so, then $N$ basically contains all integers which no prime divides twice, i.e:

$K = p_1^{\alpha_1} p_2^{\alpha_2} \cdots p_n^{\alpha_n} \in N ~ ~ \implies ~ ~ \alpha_1 = \alpha_2 = \cdots = \alpha_n = 1$

Then from this prime power factorization it follows that the number of divisors of $K$ is:

$$d(K) = \prod \left ( \alpha_i + 1 \right ) = 2^n ~ ~ (\text{since all} ~ \alpha_i = 1)$$

And $d(K) = 32$ when $n = 5$. So we are looking for the smallest $K$ which has five distinct prime factors. Trivially, the solution is:

$$p_5 \# = 2 \cdot 3 \cdot 5 \cdot 7 \cdot 11 = 2310$$
 
Re: divisors problem

Bacterius+ (Clapping)you got it(flower)
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Is it possible to arrange six pencils such that each one touches the other five? If so, how? This is an adaption of a Martin Gardner puzzle only I changed it from cigarettes to pencils and left out the clues because PF folks don’t need clues. From the book “My Best Mathematical and Logic Puzzles”. Dover, 1994.
Thread 'Imaginary Pythagoras'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top