codeboy101

def pwrsum(number):
    num_str_list = [num for num in str(number)]
    power_sum = sum([pow(int(num), 5) for num in num_str_list])

    if power_sum == number:
        return power_sum

    return 0

check_num = [i for i in range(2, 1000000)]

codeboy101

// NOTE: read only comments , comments start with '//'

import java.util.*;

public class Component {
	public static void main(String[] args){
		int range = 25000; // specify the range within which we want prime numbers
		Test euler = new Test();
		euler.getPrimes(range);
		

codeboy101

import java.util.*;

public class Experiment {

    public static void main(String[] args) {
        Puzzle primes = new Puzzle();
        int range = 25000;
        ArrayList<Integer> numbers = primes.getPrimes(range);
        for(int i : numbers){
            System.out.println("prime = " + i);

codeboy101

import java.util.*;

public class Experiment{

    public static void main(String[] args){
        int maxRange = 28123;
        Euler problem = new Euler();

        ArrayList<Integer> abundantNumbers = new ArrayList<>();
        ArrayList<Integer> finalSum = new ArrayList<>();

codeboy101

#java implementation
import java.io.File;
import java.util.ArrayList;
import java.util.Arrays;

public class Component{
	public static void main(String[] args){
		String path = "/home/icekiller/AndroidStudioProjects/Proto/app/src/main/res/raw";
	
		WorkFiles myFiles = new WorkFiles(path);

codeboy101

import tweepy 
from tweepy import API

access_token = "xyz123"
access_token_secret = "cccsc"
consumer_key = "2ee"
consumer_secret = "asd"


auth = tweepy.OAuthHandler(consumer_key,consumer_secret)

codeboy101

import time

def checkDivisors(limit):
    start = time.time()
    triangles = []
    count = 1
    running = True
    while running:
        count += 1
        triangles = sum(range(count))

codeboy101

def getDiags(number_grid):
    all_products = []
    for current_list in range(len(number_grid)-2):
        for current_num in range(len(number_grid)-2):
            combo1 = (number_grid[current_list-1][current_num-1],number_grid[current_list][current_num],
                      number_grid[current_list+1][current_num+1],number_grid[current_list+2][current_num+2])
            combo2 = (number_grid[current_list-1][current_num+1],number_grid[current_list][current_num],
                      number_grid[current_list+1][current_num-1],number_grid[current_list+2][current_num-2])

            get_product1 = multiply(combo1)

codeboy101

numbers = "08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62

codeboy101

def primes(n):
	prime_factors = [] # this is a data structure where the entries found below (that pass the if check) are stored
	for i in range(1,n): # the 'i' here is a variable here which increases in value everytime the for loop runs , the loops runs from 1 to (but not including) the 'n' 
		print("going through: " + str(i)) # print to the screen for understanding whats going on
		if n % i == 0: # if the current value of i gives 0 when 'n' is divided by it , means 'i' is a prime factor
			print("prime factor found , adding to list: " + str(i)) # again , print for understanding
			prime_factors.append(i) # .append(i) means , the current value of 'i' is added to the list (prime_factors,see 2nd line)
	return max(prime_factors) # IGNORE FOR NOW

primes(600851475143) # we are calling the function 'primes' that we defined above . the number in brackets is the value of 'n' variable