Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- *
- * @author Mat
- */
- package problem.pkg97;
- public class Problem97 {
- public static void main(String[] args) {
- Long number = new Long(2);
- final long POWEROF = 7830457;
- int count = 1; // start at 1 as 2^1 = 2
- String temp = new String();
- while(count < POWEROF){
- number = number*2;
- if(number > 1000000000){
- temp = number.toString();
- number = Long.parseLong(temp.substring(temp.length()-10));
- }
- count++;
- }
- number = (number*28433)+1;
- temp = number.toString();
- number = Long.parseLong(temp.substring(temp.length()-10));
- System.out.println("The number is: " + number );
- }
- }
- /* output
- * The number is: 275808739992577
- */
Advertisement
Add Comment
Please, Sign In to add comment