MathBlog
A man's journey through the wonderful world of Math and ProgrammingPosts Tagged with "Euler’s totient function"
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 [...]
Continue reading...
Project Euler 72: How many elements would be contained in the set of reduced proper fractions for d ≤ 1,000,000
Saturday, November 26, 2011
I don't think it is a coincidence that this exact problem comes right now as we shall see in the solution of the problem. Problem 72 of Project Euler reads How many elements would be contained in the set of reduced proper fractions for d ≤ 1,000,000?The first thing to note is that in here HCF is the same as the greatest common divisor or GCD as I usually use. The second thing to note is that we are probably looking for a very large number, but let us take a look at the problem
Continue reading...
Project Euler 70: Investigate values of n for which φ(n) is a permutation of n.
Saturday, November 12, 2011
For this problem I have taken a bit of a lazy approach with the coding and not emptied the search space, but just searched where we are most likely to find a solution. However, there are several tricks we can use when we try to find a solution. However, before babbling on, here is the problem we want to solve Find the value of n, 1 < n < 107, for which φ(n) is a permutation of n and the ratio n/φ(n) produces a minimum.Looks familiar? Well, the phi function is the same function as we looked at previously.
Continue reading...Project Euler 69: Find the value of n ≤ 1,000,000 for which n/φ(n) is a maximum.
Saturday, November 5, 2011
We are changing topics again to a more classical number theory problem with Problem 69 of Project Euler. The problem is about factoring and readsEuler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of numbers less than n which are relatively prime to n. Find the value of n ≤ 1,000,000 for which n/φ(n) is a maximum.My first thought was to reuse some of the old problems which dealt with factoring. Problem 12 was a pretty good candidate for this. However before I got that far I realised two things.
Continue reading...- 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.
- Project Euler 140: Modified Fibonacci golden nuggets
- Project Euler 139: Pythagorean tiles
- Son-Huy TRAN: I found that if 1 + a + b is prime, so : 1 + a + b > 1 => a + b > 0Because b is prime so b > 0, so if a < 0 : |a| < |b|So ...
- Jevon Jaconi: late arrival to the party and now it ends; that's my luck - j/k - have a good one and look forward to reading it again soon!;...
- Jean-Marie Hachey: Hi Kristian,Thank you very much for all the work done on your blog. Impressive production. Highly appreciated.Jeg takker dem meget, Merci b...
- Bjarki Ágúst: This is one of my favorite problems. I solved it very similarly. Given [latex]p_1[/latex] and [latex]p_2[/latex], I wanted to find an integer [latex]x...
- rebr: You can do this even in one single loop: int sundays = 0; for(DateTime date = new DateTime(1901, 1, 1); date.Date <= new DateTime(2000, 12, 31).D...
- Prashant: I see. That helps. Thanks again!...
Monday, May 21, 2012
1 Comment