Project Euler 97 - Large non-Mersennne Prime

Official link:

Thought Process

This problem is completely trivial in python, using the python pow() function computing 2^7830457 mod 10^10 is easy, actually for this problem you don't even need the pow() function.

print(28433 * 2^7830457) % 10**10 + 1) will do the trick

Interactive Code

Input 2 integers separated by a space (a, b)

Code will output last 10 digits of a*2^b + 1