# Tagged Questions

Project Euler is a series of challenging mathematical/computer programming problems. Please see the site and rules before posting.

132 views

### Project Euler's, Problem #565

Project Euler's, Problem #565 states: Let $\sigma(n)$ be the sum of the divisors of $n$. E.g. the divisors of $4$ are $1, 2$ and $4$, so $\sigma(4)=7$. The numbers $n$ not exceeding $20$ ...
65 views

### How many sets correspond to connected graphs

I'm trying to solve this project euler problem. I don't want to get too much help, since that would defeat the purpose, but I'm hitting a wall, so I'm asking a related problem here, from which I'll ...
52 views

### Possible mis-interpretation in Project Euler #21

Here is the problem statement for Problem 21 of Project Euler. Let $d(n)$ be defined as the sum of proper divisors of $n$ (numbers less than $n$ which divide evenly into $n$). If $d(a) = b$ ...
37 views

### The largest product of two n-digit numbers which is palindrome

Project Euler: 4 is stated as follows: Largest palindrome product A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 ...
55 views

### Game of Nim: Losing Positions [closed]

If you have heard of the game Nim, this is a version of the game. However, in this version, the players can only remove the amount of stones from the pile which is coprime to the current pile size. ...
613 views

### repunit prime factors

So I am working on this problem... which states: A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k; for example, R(6) = 111111. Let ...
81 views

### Project Euler 106: Necessary and sufficient conditions

Problem Statement Let S(A) represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are ...
19k views

### Find the largest prime factor

I just "solved" the third Project Euler problem: The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? With this on Mathematica: <...
86 views

### Help Project Euler Problem 269

I am stuck on prob 269 Project Euler. I've just tried brute force method to attempt this problem the example provided by PE For example, $P_{5703}(x)$ = $5x^3 + 7x^2 + 3$. We can see that: P$_n(0)$...
365 views

### Algorithm for generating an ordered list of pair products

For problem 4 in the euler project part of the assignment is to generate a list of products of 3-digit numbers. The easy way is to just do a cartesian product (I think it's called), and after that ...
80 views

### Proof that nonconstant polynomial cannot have the same value at all integer points

I am reading the solution to the Project Euler problem 28 here, specifically the one under 'Deriving a non-iterative formula'. That solution first deduces the degree of the polynomial, and then ...
88 views

### (Soft Question) Is it bad to use Sage built in functions instead of creating my own?

I've been doing Project-Euler just as a way to increase my competency in computer science. I'm currently a Pure and Applied Math major who recently adopted computer science as a minor in order to ...
277 views

### Expected value of a guessing game

I'm trying to solve project euler 527, I don't understand how the expected value of B(6) is taken. A secret integer t is selected at random within the range 1 ≤ t ≤ n. The goal is to guess ...
64 views

### How to simplify a sum of complex divisors?

This question arises from Project Euler 153. That problem asks for the sum of all complex divisors of all natural numbers up to a maximum, where a complex divisor is a complex number of the form a + ...
160 views

Reading https://projecteuler.net/problem=251 I'm attempting to solve the example provided : $3 \sqrt {a + b \sqrt c}$ + $3 \sqrt {a - b \sqrt c}$ = 1 a=2 b=1 c=5 $3\sqrt {2+(1)\sqrt5} + 3\... 1answer 610 views ### Project Euler, Problem #529 10-substrings Have anyone tried the problem 529? I tried but I'm confronted to a very high complexity$O(N^2)$with$N$being the length of the number. The code is: ... 2answers 106 views ### Explaining solution of Project Euler problem #5 Here is the problem. Pretty simple to brute force, but more gently solutions are not that easy to understand, and I'm not talking about programming issue, but math-affiliated. For example, I'm ... 3answers 1k views ### Are there any mathematics “problem websites” similar to Project Euler? Are there any mathematics websites similar to Projet Euler, a website which hosts math-heavy programming questions, many of which can be solved with a pen and paper? I've become almost addicted to ... 3answers 4k views ### Finding prime factors by taking the square root I'm trying to solve the third Project Euler problem and I'd like a little help understanding a mathematical concept underlying my tentative solution. The question reads: The prime factors of ... 1answer 99 views ### Summation of a function Let$n$is a positive integer.$n = p_1^{e_1}p_2^{e_2}...p_k^{e_k}$is the complete prime factorization of$n$. Let me define a function$f(n)f(n) = p_1^{c_1}p_2^{c_2}...p_k^{c_k}$where$c_k = ...
86 views

The problem is here and someone gave this answer but I don't understand it even if I know the rule of large numbers. If you want to write a code for this, it is really boring. On the other hand, ...
64 views

### How to find $a_n$ series from Dirichlet generating function

I am solving problems from Project Euler. Solutions for some of the problems is $n^{\rm th}$ term of a series. I know Dirichlet generating functions. How to find $n^{\rm th}$ term of a series from ...
405 views

### Number of closed paths formed by arcs of one fifth of a circle

**I was trying to solve the following issue: Find the number of possible closed paths using one fifth of an arc ($72^o$), where at each time step we can move either clockwise or anti-clockwise. in ...
804 views

### Primitive integer triangles

Consider the triangles with integer sides $a$, $b$ and $c$ with $a \leq b \leq c$. An integer sided triangle $(a,b,c)$ is called primitive if $gcd(a,b,c)=1$. How many primitive integer sided triangles ...
186 views

### Project Euler Problem #87 - Prime power triples

I found this problem in Project Euler: https://projecteuler.net/problem=87 The smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is $28$. In fact, ...
72 views

### Finding the last nonzero digit of the factorial of a large number

This problem is from projecteuler problem 160. I am not looking for an answer or anything like that I just got stuck on some of the mathematics and am looking for some help. Instead of solving the ...
221 views

### Calculating two rotation angles from xyz coordinates for dummies

This post is a bit verbose so that others who come later may benefit from my thick headedness. I am attempting to construct a primitives composition and constructed solids geometry parser/processor ...
453 views

### Base conversion: How to convert between Decimal and a Complex base?

My motivation for this question is exploring beyond the ideas in Project Euler Problem 508. In that problem, it is helpful to know how to convert between a decimal number and a number in base $(-1+i)$....
315 views

### square of digits - why does it always contain 1 or 89 [closed]

I attempted project euler problem 92, while I passed it, my solution works, but had just...awful performance. So I would like to try again tomorrow. In the meantime understanding why the iteration ...
105 views

### Number of 1s in after converting number to base -1+i

Regarding to Base conversion: How to convert between Decimal and a Complex base? Let $s(a,b)$ is a number of $1$ after converting complex number $a+bi$ to base $-1+i$. It's easy to implement that ...
110 views

### Where is my formula false??

I wrote a formula that returned how many numbers in a given row of pascals triangle are divisible by a given prime. This formula was created to answer https://projecteuler.net/problem=148. I was ...
4k views

### How to find the smallest number with just $0$ and $1$ which is divided by a given number?

Every positive integer divide some number whose representation (base $10$) contains only zeroes and ones. One can easily prove that using pigeonhole principle. ...
376 views

### Project Euler #453 confusion

So I decided to give a shot on the #453 project euler problem but there is something that confuses me with the numbers given. I decided to start by calculating the possible arrangements of 4 vertices ...
48 views

An addition chain is an ordered tuple of numbers, starting with $1$, such that each number after $1$ can be expressed as the sum of two smaller numbers in the chain. An example of an addition chain ...
553 views

77 views

### Number of paths through a grid

I am attempting to solve Project Euler prob. 204 by hand, and I decided that this method should help a lot. I have the following grid: The numbers indicate the total number of paths from a node at ...
32 views

### What rules can I apply for divisible numbers?

I'm trying to solve Project Euler problem 12. I've figured out a fast algorithm for the triangle numbers, but to see if they are devisable is just a pain... ...