Counting Zeros in the Product of Natural Numbers up to 1962!

  • Thread starter Thread starter Kartik.
  • Start date Start date
  • Tags Tags
    Count
Kartik.
Messages
55
Reaction score
1
Question- How many zeros are there in the product of all the natural numbers right from 1 to 1962 or in short in 1962! ?

Attempt-
Well,
The product as a product of prime numbers, will denoted as -
Let the product be N,

N = 2a1 . 3a2 . 5a3 . ... pax


As far as i see it we will have to count the number of 5s and 2s that occur in the product N's representation above and also the factors which will yield 5s or 2s.So by far we are concerned only to the numbers a1 and a3.And here lies my problem, how will we calculate the number of occurrences and also figure out that how many other factors will yield how many 5s or 2s ?
 
Mathematics news on Phys.org
You only need to calculate a3, the value of a1 is not needed for the answer (of course you should figure out why)

To figure out what a3 is, it might help to first reason how you could calculate the number of times 5 divides a smaller number like 100! (where you can calculate this by hand) and then see how you would extend the result
 
The number of 2's is obviously greater than the number of 5's, so there's always a 2 for each 5 to give a 10, and that reduces your work by half :wink: Now, the total number of 5's in any given number will be equal to the number of times it can be divided by 5. But, there are some terms which have two 5's, meaning they are multiples of 25. Here you need not count the one's you already got due to division by 5. Next would be 5*5*5, that's 125 and so on. Hope this gives you an idea.
 
Kartik. said:
Question- How many zeros are there in the product of all the natural numbers right from 1 to 1962 or in short in 1962! ?

Attempt-
Well,
The product as a product of prime numbers, will denoted as -
Let the product be N,

N = 2a1 . 3a2 . 5a3 . ... pax


As far as i see it we will have to count the number of 5s and 2s that occur in the product N's representation above and also the factors which will yield 5s or 2s.So by far we are concerned only to the numbers a1 and a3.And here lies my problem, how will we calculate the number of occurrences and also figure out that how many other factors will yield how many 5s or 2s ?




As the number of 2's is clearly way larger than that of 5's, all you've to do is calculate what's the highest power of

5 that divides \,\,1962!\,\,, which is given by \displaystyle{\sum_{n=1}^\infty\left[\frac{1962}{5^n}\right]} with \,\,[x]=\,\, the integer part of the real number x (why is this formula true and why is the above a finite sum?)


BTW, and if you're interested, the number is \,\,488 = 392+78+15+3

DonAntonio
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top