• 摘要视图
  • 目录视图

Problem 42 Coded triangle numbers

Problem 42: Coded triangle numbers

https://projecteuler.net/problem=42

The nth term of the sequence of triangle numbers is given by, tn = ½n(n+1); s[……]

>> 阅读全文…

Problem 32 Pandigital products

Problem 32: Pandigital products

https://projecteuler.net/problem=32

We shall say that an n-digit number is pandigital if it makes use of all the dig[……]

>> 阅读全文…

Problem 23 Non-abundant sums

Problem 23: Non-abundant sums

https://projecteuler.net/problem=23

A perfect number is a number for which the sum of its proper divisors is exactly e[……]

>> 阅读全文…

Problem 1 Multiples of 3 and 5

Problem 1: Multiples of 3 and 5

https://projecteuler.net/problem=1

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get[……]

>> 阅读全文…