Project Euler 16

Summary

Getting the sum of the digits of the number 2^1000, in C Playlist for this series ... uses BigInteger to get 2^1000 We get the toString then use the individual characters to solve the problem -~-~~-~~~-~~-~- Please ... In this series, I share my solutions to all of the In this video, I will be coding the solution for the problem # 2 to the power of 15 equals 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. The aim is to find the sum of the digits of 2 to ... twitter.com/evildojo666 twitch.tv/evildojo666 In this video, I solve a In this video I show how to find the digits of a number, how to represent a number in different bases (binary and hexadecimal), and ... Want my help with your code? the options here: bio.site/problemsolvingwizard Power Digit Sum. for more videos! 215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of the number 21000? Really quick and easy video showing my solution for problem Scala's BigInt type makes this problem far too easy to the point where it feels cheating! In this video I tackle a problem about cyclic sets of figurate numbers. Have you ever heard of a heptagonal number?