Prove $10^{\dfrac{5^n -1}{4}} \Huge\vert (5^n)!$ for $Z^+$

  • Context: MHB 
  • Thread starter Thread starter karush
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around proving the divisibility statement $10^{\dfrac{5^n -1}{4}} \Huge\vert (5^n)!$ for all positive integers $n$. Participants explore the implications of the notation and consider methods for proof, including specific cases and mathematical induction.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Homework-related

Main Points Raised

  • One participant seeks clarification on the notation used, particularly the meaning of the vertical bar and factorial.
  • Another participant explains that the vertical bar indicates divisibility, providing an example for clarity.
  • There is a suggestion to test the statement by setting $n=1$, with one participant noting that it holds true in this case since $10$ divides $120$.
  • A later reply proposes using mathematical induction to extend the proof beyond the base case of $n=1$, although the participant admits to not having fully considered the problem yet.

Areas of Agreement / Disagreement

Participants generally agree on the validity of the statement for $n=1$, but there is no consensus on the overall proof or the effectiveness of the proposed methods, such as induction.

Contextual Notes

Some participants express uncertainty about the notation and the approach to the proof, indicating a need for further clarification on definitions and methods.

karush
Gold Member
MHB
Messages
3,240
Reaction score
5
prove
$10^{\dfrac{5^n -1}{4}} \Huge\vert (5^n)!$
for all $Z^+$

ok this was sent to me on email but thot I could solve it but ?

first I assume the vertical bar means such that

not sure if ! means factorial or not negative

anyway curious
 
Physics news on Phys.org
$a \mid b$ means $a$ divides $b$.

The following formula may help.

Legendre's formula: For any prime number $p$ and any positive integer $m$, let
${\displaystyle \nu _{p}(m)}$ be the exponent of the largest power of $p$ that divides $m$. Then

$${\displaystyle \nu _{p}(m!)=\sum _{i=1}^{\infty }\left\lfloor {\frac {m}{p^{i}}}\right\rfloor}$$
 
ok i have never tried that
are you sure the vertical bar means a/b?
 
karush said:
ok i have never tried that
are you sure the vertical bar means a/b?
Not a/b it's a divides into b evenly. For example, 3|15 and 5|15.

-Dan
 
oh
can we prove this just by setting n=1
 
karush said:
oh
can we prove this just by setting n=1
I don't know what you mean.

It's true for $n=1$ because $10$ divides $120$.
 
karush said:
oh
can we prove this just by setting n=1
From there use Mathematical Induction. It should be rather easy but I haven't really spent much time thinking about it. (ie. If it works for n = 1 then you always have that factor.)

-Dan
 

Similar threads

  • · Replies 21 ·
Replies
21
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 61 ·
3
Replies
61
Views
12K
  • · Replies 86 ·
3
Replies
86
Views
14K