Find the Smallest Divisible Integer: POTW #405 Feb 20th, 2020

  • MHB
  • Thread starter anemone
  • Start date
In summary, the "Find the Smallest Divisible Integer" problem is a mathematical challenge presented on Project Euler, requiring the smallest positive integer that is evenly divisible by all numbers from 1 to 20. This problem is significant as it requires critical thinking and has real-world applications. The most common approach to solving it is through prime factorization, though there is no limit to the numbers that can be used. Some shortcuts, such as using the LCM rule, can be used but ultimately the problem still requires mathematical reasoning and calculations.
  • #1
anemone
Gold Member
MHB
POTW Director
3,883
115
Here is this week's POTW:

-----

Let $n$ be the smallest positive integer such that $n$ is divisible by 20, $n^2$ is a perfect cube, and $n^3$ is a perfect square. What is the number of digits of $n$?

-----

Remember to read the https://mathhelpboards.com/showthread.php?772-Problem-of-the-Week-%28POTW%29-Procedure-and-Guidelines to find out how to https://mathhelpboards.com/forms.php?do=form&fid=2!
 
Physics news on Phys.org
  • #2
Congratulations to the following members for their correct solution!

1. castor28
2. kaliprasad
3. MegaMoh

Solution from castor28:
If $p$ is a prime that divides $n$ with exponent $\alpha_p$, $2\alpha_p$ must be divisible by $3$, and $3\alpha_p$ must be divisible by $2$; therefore $\alpha_p$ must be divisible by $6$.

If $p$ is other than $2$ or $5$, the smallest acceptable multiple of $6$ is $0$: the only primes dividing $n$ are $2$ and $5$.

On the other hand, since $20 \mid n$, we must have $\alpha_2 \ge 2$ and $\alpha_5 >= 1$, this gives $\alpha_2=\alpha_5=6$.

We have therefore $n=2^6\cdot5^6 = 10^6$, a number of $\bf 7$ digits.
 

FAQ: Find the Smallest Divisible Integer: POTW #405 Feb 20th, 2020

What is the challenge of "Find the Smallest Divisible Integer"?

The challenge is to find the smallest positive integer that is evenly divisible by all numbers from 1 to 20.

How is the smallest divisible integer calculated?

The smallest divisible integer can be calculated by finding the least common multiple (LCM) of all numbers from 1 to 20. This can be done by breaking down each number into its prime factors and then finding the product of the highest power of each prime factor.

What is the significance of this challenge?

This challenge is significant because it tests problem-solving skills and mathematical thinking. It also has practical applications in areas such as scheduling and optimization.

Is there a known solution for this challenge?

Yes, the solution for this challenge is known and is equal to 232,792,560.

Are there any strategies or tips for finding the smallest divisible integer?

One strategy is to start with the highest number, 20, and check if it is evenly divisible by all numbers from 1 to 20. If not, then increment by 20 and check again until the number is found. Another tip is to use prime factorization to simplify the process of finding the LCM.

Back
Top