The MathBlog tools collection updated

Just wanted to make a bit of advertisement for the tool section of the website which have been updated and new tools added.

Bjarki has been busy and developed several new tools which might come in handy for you when trying to see if a hypothesis could lead to a solution for the problem you are sitting with.

Updated tools

First of all the Prime factorization tool has been updated.  So now it gives you a little more than just the factorization. It gives you the number of distinct factors, the number of divisors and not least the value of Euler’s totient function. Yep that’s right, so head over and check it out.

New tools

We have 4 new tools. A base converter for converting between different arbitrary bases up to base 36, then we ran out of characters. My guess is that it will mostly be used for base 2,8,10 and 16. At least those are the once that I usually need.

The second tool we have added, or rather Bjarki has developed is a tool which deals with the decimal representation of fractions.  It calculates the decimal representation of a fraction up to a given precision. It will also give you the repeating decimals if any, and not least can it give you the continued fraction expansion.

Next let Bjarki created a small java script for converting between infix and postfix notation. The latter is also known as reverse Polish notation. Personally I don’t know what to use it for yet, but Bjarki has assured me that it will be relevant for later Project Euler Problems.

The last mathematical tool that have been added is a Generator for Primitive Pythagorean triplets. It generates all Primitive Pythagorean Triplets with c less than a given number.

The blog image is created by zzpza and shared under the creative commons license.

Posted by Kristian

2 comments

Bjarki Ágúst

I also encourage people to let us know if there are any tools they would like to see added.

Jean-Marie Hachey

Tools suggested:

1) Sudoku solution
http://www.solution-sudoku.com/Default.aspx

(Re : Project Euler – Problem 96)

___

2) Big primes
BIG Primes.NET
http://www.bigprimes.net/index.php

Example of output :

The number you submitted to be crunched was:
1 999 993 – one million nine hundred ninety nine thousand nine hundred ninety three

It is an odd number.
It is not a palindrome.
It is the 148933rd prime number.
It is not a mersenne prime number.
It is not a fermat number.
It is not a perfect number.

It is not a triangle number.
It is not a square number.
It is not a cube number.

It is not a factorial number.
It has no factors except itself and 1.

(Re : Project Euler – Problem 10)

Leave a Reply