My Math Forum Divisible for natural numbers
 User Name Remember Me? Password

 Number Theory Number Theory Math Forum

 April 14th, 2017, 04:22 AM #1 Senior Member   Joined: Dec 2015 From: Earth Posts: 227 Thanks: 26 Divisible for natural numbers Show that :$\displaystyle 5^n$mod $\displaystyle (40^n n!)=0$ $\displaystyle n\in N$
April 14th, 2017, 05:09 AM   #2
Senior Member

Joined: Feb 2010

Posts: 679
Thanks: 127

Quote:
 Originally Posted by idontknow Show that :$\displaystyle 5^n$mod $\displaystyle (40^n n!)=0$ $\displaystyle n\in N$
I'm not certain which of these you mean:

A) Show that $\displaystyle 5^n \equiv 0$ mod $\displaystyle 40^nn!$

or

B) Show that $\displaystyle 40^nn! \equiv 0$ mod $\displaystyle 5^n$

A is not true and B is trivial.

 April 14th, 2017, 08:23 AM #3 Senior Member   Joined: Dec 2015 From: Earth Posts: 227 Thanks: 26 Show that $\displaystyle \frac{(5n)!}{40^n n!}\in N$ Last edited by idontknow; April 14th, 2017 at 08:28 AM.
April 15th, 2017, 07:21 AM   #4
Senior Member

Joined: Feb 2010

Posts: 679
Thanks: 127

Quote:
 Originally Posted by idontknow Show that $\displaystyle \frac{(5n)!}{40^n n!}\in N$
Well this is a totally different question from what you first asked. Thus it should be in a brand new post.

It is a routine induction.

 April 15th, 2017, 08:56 AM #5 Member   Joined: Jan 2016 From: Athens, OH Posts: 89 Thanks: 47 Here's a solution for your corrected problem: I just noticed the last post and realized a much easier induction proof is the way to go.

 Tags divisible, natural, numbers

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post ankush Elementary Math 10 September 14th, 2014 10:53 PM Eureka Number Theory 4 November 3rd, 2012 03:51 AM kpinky Algebra 26 April 19th, 2012 05:50 PM jinjouk Number Theory 12 June 3rd, 2008 06:11 AM kpinky Calculus 0 December 31st, 1969 04:00 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top