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

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

Discussion Overview

The discussion centers around identifying the smallest number that is divisible by all integers from 2 to 10, with a particular focus on whether this number is 7560 or 2520.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant questions whether 7560 is the smallest number divisible by 2 to 10.
  • Another participant proposes that 2520 is the correct answer, providing its prime factorization as 23 x 32 x 5 x 7.
  • A subsequent reply acknowledges a missing factor of 4 in the initial reasoning, leading to a correction towards 2520.
  • Further elaboration includes a step-by-step method for determining the smallest number by crossing out redundant factors, ultimately arriving at 2520.
  • Another participant suggests a general method for finding the lowest number divisible by all integers less than a given N, using prime factorization and highest powers of primes.

Areas of Agreement / Disagreement

Participants generally agree that 2520 is the smallest number divisible by all integers from 2 to 10, but there is initial uncertainty regarding the correctness of 7560.

Contextual Notes

Some participants express confusion over the inclusion of certain factors and the methods used to derive the smallest number, indicating potential limitations in understanding or assumptions about the problem.

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
4K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K