If you for any reason want to contact us, feel free to use this form to send me an email. We will get back to you as fast as possible.

If you for any reason want to contact us, feel free to use this form to send me an email. We will get back to you as fast as possible.

Grab the RSS feed for Free Updates!

(What's this? — Learn more about RSS)

subscribe

OR Get blog updates sent directly to your inbox by entering your email address below:

- Project Euler 267: Billionaire
- Making decisions under uncertainty in everyday life
- Taking a break
- Project Euler 146: Investigating a Prime Pattern
- Project Euler 145: How many reversible numbers are there below one-billion?
- UVa Online Judge New Platform
- Project Euler 144: Investigating multiple reflections of a laser beam.
- Project Euler 143: Investigating the Torricelli point of a triangle
- Project Euler 142: Perfect Square Collection
- Project Euler 141:Investigating progressive numbers, n, which are also square.

**Jean-Marie Hachey**: Output of the results using extension of RosettaCode in C#https://rosettacode.org/wiki/Sum_multiples_of_3_and_5#C.23The sum of numbers divisib...**Jean-Marie Hachey**: Digits distribution pattern in the sums of multiples of 3 and 5{Range} [Sum of multiples of 3 and 5]Ex: {1-1000} [233168] {1-10000} [23...**Jean-Marie Hachey**: Solution to Project Euler, Problem 1, using Python (v.3.6.1)>>> import time >>> start_time = time.time() >>> >>...**Gaurang Tandon**: Your method [code]private int PrimeFactorisationNoD`[/code] is not properly formatted. The first `if` statement is appearing inside a comment....**John Varga**: did they change this question since you answered? the problem asks for the product of 13 consecutive digits, not 5....**Muhammad**: I have been checking this blog after every problem I solve since #20 or so. This is the first time ever that I come with a faster solution, and not j...

Algebra API Arithmetic BigInteger Brute Force C# Calculus Combinatorics Competition Continued fractions Coprimes Diophantine Equation Dynamic Programming Euler's totient function Factorial Fibonacci Fractions Geometry Greatest Common Divisor Induction Java Jokes Linear Algebra Links Modulo Palindromes Pandigital Pell's equation Pen & Paper Pentagonal numbers Permutations Prime factorisation Prime Generation Prime numbers Programming Project Euler Proofs Pythagoras Recursion Repunit Sequences String Manipulation Teaching UVa Online Judge Video

search#### Search the Site:

This site uses cookies. ☒