the freelance hellraiser

I was asked by a friend to find the whereabouts of a song "want you to know". I didnt know anything much about the song other than you can listen to it www.thefreelancehellraiser.com. So I browsed through the site, and found their jukebox. I listened to the song and I liked it.

My friend suggested that the song must have been downloaded into the temp files of internet explorer. At first i thought that the site admins must have taken that into account to stop illegal downloading from their own site. But I checked it and it was right there in my Temporary Internet Files folder. The admins hadnt managed to cover up the streamed audio.

To get that song, go to www.thefreelancehellraiser.com and listen to any of their song.

then Go to (windows installation partition)\Documents and Settings\(windows user account name)\Local Settings\Temporary Internet Files

sort the files by "Last Accessed" and near the end of that folder, you'll find a file named track(a 2 digit tracknumber).mp3

the (tracknumber) will be a two-digit number of the track from the playlist on www.thefreelancehellraiser.com

Simply copy the file from that folder and place it anywhere you like.

---

I also found another way.. Its simpler.

To download any of their songs, just go to www.thefreelancehellraiser.com/jukebox/track(tracknumber).mp3 where track number is the number of the track from the playlist on their site.

NOTE: The track number is in 2 digits i.e. for the first song "want you to know", use tracknumber as 01

For example, the link for the song "want you to know" is www.thefreelancehellraiser.com/jukebox/track01.mp3

Use a download manager, to save the above link onto your computer.
---

NOTE: The above procedure should not be used for any illegal purpose. The user is himself/herself responsible for any way he/she uses the content on the site.

Something About Prime Numbers

This is a part of the article i found really interesting.

Back in August an new algorithm was announced for determining if large numbers were prime. I wondered if this panned out. I further wondered what the implications were for cryptographic systems that depend on the difficulty of factoring large numbers into primes.

A team of Indian scientists has developed a solution for an ancient and important problem — how to find out whether a number is a prime or not. Professor Manindra Agrawal, with his students Mr Neeraj Kayal and Mr Nitin Saxena from the Indian Institute of Technology in Kanpur, came up with a computer algorithm that solves the problem. The students have only recently completed their undergraduate degrees. Their result was announced on August 4 and published on their website on August 7. Within 24 hours, more than 30,000 people worldwide had downloaded the paper.

"The strength of this process is it says a number is prime if and only if it is prime. There is no percentage margin of error," said triple j's Mr Adam Spencer, a mathematician by training. The algorithm, or set of instructions, is unique because it is 100 per cent accurate — something that has not been achieved before. Prime numbers are divisible only by themselves and the number one. They are extremely valuable in computing science and mathematics.

Encryption of information transferred over the Internet, for example, is achieved in 'packages' of large semi-prime numbers (which are divisible only by two prime numbers). These packages are known as RSA numbers, and unless the receiver knows which prime numbers are used to make the RSA number, they will not be able to decode the information. "Any developments in terms of determining primes, or calculating primes, or unravelling if things are semi-prime, will have implications for cryptography because the basis of cryptography is knowing massive prime numbers," Mr Spencer explained. But until now there has not been an efficient method of determining whether a number is prime or not — a dilemma known as the primality testing problem.

Existing computer programs are able to estimate prime numbers, but they carry a small degree of inaccuracy — either failing to find a prime number, or coming up with a number that actually isn't prime. While the new algorithm is a polynomial time algorithm — one that is efficient in the time it takes to compute — current methods are faster because they use less steps.The Indian researchers have indicated that their next challenge will be to reduce the number of steps.

The 10 largest prime numbers known are Mersenne primes, named after the 17th-Century French monk Marin Mersenne. He established that (2^p)–1 (that is, two to the power of 'p', minus one — where p is a prime number) is sometimes prime. This is the form of most of the large primes discovered, said Mr Spencer. "These Mersenne numbers aren't always prime," he explained. "But with Mersenne numbers it's particularly easy to test if they are prime or not." By contrast, the process to determine if any random number is prime or not is extremely complicated. The new algorithm offers a foolproof way of doing this. The algorithm does not, however, generate prime numbers — and to date there is no way to do this.

"If someone was to develop a program that was able to factorise numbers, the whole security process of data would collapse," said Mr Spencer.

The IDEAs

For a long time, i had been thinking to have a blog, but everytime i fell short of stuff to put up. I'm not a thinker/philosopher, so generally i dont have much to say which the general junta likes. Most blogs that i had gone through, consisted of poems, fundas of life etc etc.. but somehow, stuff like this never amazed me. I had interests of my own, but those were not the common ones. And therefore, most of the time i fell short of people to share my thoughts..

I intend to make this blog my idea bank, scribbling even the stupidest idea that comes to my mind. If nothing else, then some time later i'll b laughing my own thoughts..