Max $m$ for $(\frac{1}{11^m}\prod_{i=1000}^{2014}i)\in N$

  • MHB
  • Thread starter Albert1
  • Start date
  • Tags
    Max
In summary, the value of m that satisfies the given condition is 11. To solve this problem, one would simplify the expression inside the parentheses and use the fact that it should be a whole number to find the value of m. An example of this solution is using the numbers from 1000 to 1010 and finding that m=11 satisfies the condition. The only solution for m can be proven using the Fundamental Theorem of Arithmetic, which states that every positive integer can be expressed as a unique product of prime numbers. This problem is significant in mathematics as it relates to prime factorization and the Fundamental Theorem of Arithmetic, and demonstrates how complex expressions can be simplified using basic mathematical principles.
  • #1
Albert1
1,221
0
$(\frac{1}{11^m}\prod_{i=1000}^{2014}i)\in N$
please find max($m$)
 
Mathematics news on Phys.org
  • #2
Albert said:
$(\frac{1}{11^m}\prod_{i=1000}^{2014}i)\in N$
please find max($m$)

we need to find how many numbers between 1000 and 2014 are divisible by $11 ,11^2, 11^3$ so on

$\lfloor\dfrac{999}{11}\rfloor = 90$
$\lfloor\dfrac{2014}{11}\rfloor\ = 183$

$\lfloor\dfrac{999}{11^2}\lfloor\ = 8$
$\lfloor\dfrac{2014}{11^2}\rfloor\ = 16$

$\lfloor\dfrac{999}{11^3}\lfloor\ = 0$
$\lfloor\dfrac{2014}{11^3}\rfloor = 1$

so number of numbers divisible by 11 is 93 by $11^2$ is 8 and $11^3$ is 1

so highest poser is 93 + 8 +1 = 102
or m = 102
 

FAQ: Max $m$ for $(\frac{1}{11^m}\prod_{i=1000}^{2014}i)\in N$

What is the value of m that satisfies the given condition?

The value of m that satisfies the given condition is 11.

How do you approach solving this problem?

I would first simplify the expression inside the parentheses by finding the product of the numbers from 1000 to 2014. Then, I would use the fact that the expression should be a whole number (N) to find the value of m.

Can you provide an example to demonstrate the solution?

For example, if we take the numbers from 1000 to 1010, the product is 1000x1001x1002x1003x1004x1005x1006x1007x1008x1009x1010 = 1010!. Therefore, m=11 satisfies the condition (1/11^11 x 1010! = 1/N).

How can we prove that m=11 is the only solution?

We can use the Fundamental Theorem of Arithmetic which states that every positive integer can be expressed as a unique product of prime numbers. Since 11 is the only prime number in the denominator, it must be the only solution that satisfies the condition.

What is the significance of this problem in mathematics?

This problem relates to the concept of prime factorization and the Fundamental Theorem of Arithmetic. It also shows how seemingly complex expressions can be simplified and solved by using basic mathematical principles.

Similar threads

Replies
2
Views
1K
Replies
2
Views
1K
Replies
2
Views
1K
Replies
10
Views
2K
Replies
2
Views
2K
Replies
1
Views
1K
Back
Top