perplexus.info :: Algorithms : Deux Power Divisibility

Deux Power Divisibility (Posted on 2015-04-12)

N is a positive integer and F(N) denotes the sum of the base ten digits of N.

Derive an algorithm to determine the values of N such that F(2^N) is divisible by 10.

Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Solution: (Hide)

Refer to the solution submitted by Charlie in this location.

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
re: continuation of Jer's table	K Sengupta	2023-01-09 01:56:09
re: continuation of Jer's table	Jer	2015-04-12 17:15:52
continuation of Jer's table	Charlie	2015-04-12 13:27:24
A sequence and some thoughts.	Jer	2015-04-12 10:39:57

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info