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.

See The Solution Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

re: continuation of Jer's table

Comment 4 of 4 |

(In reply to continuation of Jer's table by Charlie)

Ty, Charlie. I confirm having hyperlinked your methodology in the official solution.

Posted by K Sengupta on 2023-01-09 01:56:09

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 (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info