Smallest Number Divisible by 2-10: Is it 7560?

  • Context: High School 
  • Thread starter Thread starter franz32
  • Start date Start date
Click For Summary
SUMMARY

The smallest number divisible by all integers from 2 to 10 is 2520, confirmed through prime factorization as 23 x 32 x 5 x 7. The discussion highlights a method of eliminating redundant factors by starting from the highest number and crossing out multiples. Additionally, it explains a general approach for finding the least common multiple (LCM) by using prime numbers and their highest powers, exemplified with N=16 resulting in 720720.

PREREQUISITES
  • Understanding of prime factorization
  • Familiarity with least common multiple (LCM) concepts
  • Basic knowledge of mathematical notation (e.g., exponents)
  • Ability to perform multiplication of integers
NEXT STEPS
  • Study prime factorization techniques in depth
  • Learn how to calculate the least common multiple (LCM) using prime factors
  • Explore the concept of greatest common divisor (GCD) for comparative analysis
  • Investigate applications of LCM in real-world problems, such as scheduling
USEFUL FOR

Mathematicians, educators, students, and anyone interested in number theory or solving problems involving divisibility and multiples.

franz32
Messages
133
Reaction score
0
Hello! I am just curious... what is the smallest number that is divisible from 2 to 10? Is it 7560?
 
Physics news on Phys.org
Try 2520 = 2^3 x 3^2 x 5 x 7
 
Nexus[Free-DC] said:
Try 2520 = 2^3 x 3^2 x 5 x 7

Im missing the four.
:confused:
 
mee, 4 = 2^2...
 
I see...

Oh, it's 2520 then... I didn't think of it... well, thanks for the help. =)
 
Write down the numbers 2,3,4,...10. Start from the top, ie. 10. Now since 10 = 2*5, cross these two out. Then there's 9 = 3*3. So you can cross out 3. Also you can cross out 6, since you have a 2 from 10 and a 3 from 9. Then you come to 8 = 4*2. Since you already have the 2 (from 10) you only need 4. So you write down 4 instead of 8 and cross out the 4. Then there's 7, which is prime (and uncrossed-out) so you need it. All lower numbers have been thrown out as redundant, so that's it :10*9*4*7 = 2520.

The other way of doing it is by using only the prime numbers (see Nexus' solution) and making sure all other numbers are covered through the various products of these prime numbers.
 
You can prove, somehow, that to find the lowest number divisible by all numbers less than N, all you have to do is list all the primes not less than N and find the highest powers of those primes not less than N.

Take N=16 for example. The primes below 16 are 2,3,5,7,11 and 13 and the corresponding highest powers are 2^4,3^2,5,7,11,13. So the lowest number divisible by 2 to 16 is 2^4 x 3^2 x 5 x 7 x 11 x 13 = 720720.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 40 ·
2
Replies
40
Views
7K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
3
Views
1K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K