WebConsider the sum S = ∑ k = 1 n k As I was computing the first triangle number with over 500 divisors (Project Euler), I came across the hypothesis that most triangle numbers have an even number of divisors (if n = 8, then S = 36 has 9 divisors). Example:

Project Euler #12 - first triangle number with more than 500 divisors

WebThis will create a set and put all of factors of number n into it. Second, use while loop until you get 500 factors: a = 1 x = 1 while len(factors(a)) < 501: x += 1 a += x This loop will … WebFeb 15, 2024 · The loop continues until it finds a triangular number with 500 divisors. The first two lines increment the index and create the next triangular number. The third line in the loop determines the number of times each factor is repeated (the run lengths). The last line calculates the number of divisors using the above-mentioned formula. flipper rancho

Name already in use - Github

WebJul 29, 2024 · First few triangular numbers are 1, 3, 6, 10, 15, 21, 28, … Examples: Input: N = 2 Output: 6 6 is the first triangular number with more than 2 factors. Input: N = 4 … WebWe can see that 28 is the first triangle number to have over five divisors. What is the value of the first triangle number to have over five hundred divisors? The first thing I did was to generate 2 functions, one for determining the nth triangular number, and the other for determining number of factors. Both these were fairly simple functions: WebAug 16, 2012 · #include using namespace std; int triangle_numbers (int n, int meh = 0) { int count = 0; //calculate how many divisors there are for meh for (int i = 1; i 500) return … flipper race