Owner: aatiis|blog URL:http://aatiis.blogspot.com Join Date: Mon, 21 Apr 2008 19:40:54 -0500 Rating:0 Site Description: A little bit of everything: blogging, design, programming, gaming, math, and other find stuff I make or find interesting. Site statistics:Click here
The First 140,000 Palindromic Primes 2008-04-21 08:59:00 For all you out there who are interested in prime numbers (hey, primes are fun, aren't they?), I have uploaded a list of the first 140,000 palindromic primes (sequence A002385 in OEIS). Actually, there's slightly more than 140,000. Here's a download link if you want to take a look (it's uncompressed, almost 2 Mb). I'll calculate all the 15-digit long palindromic primes in a few days, I'll post a link here.
Actually I'm thinking about putting together a wiki about prime numbers, or more of collection of them. I'll see if I can get free Python hosting for the site on Frihost. Why Python? Well, I'm collecting numbers and digits for quite a long time now, and I'd like to create something like a service... Like, you enter a number, say 666, it gives you out a bunch of interesting (mostly math-r Read more:First
Converting Hit'n Run Visitors to Targeted Traffic with BlogUpp! 2008-04-19 20:54:00 Ok, this is not very new, probably most of you already know about BlogUpp!, the site that puts your blog's thumbnail on other people's blogs, without even registering. It is a real breakthrough in ease-of-use, updates the links regularly, and has a fair 10:9 sharing ratio (the best I've seen out there).
This can come in handy if you already have a source of visitors, be it well targeted or not. Manual traffic exchange is an example, although not very common among bloggers. Also, if you write a good story that hits the Digg first page, you can easily get around 1000-2000 visitors in a single weekend, many of which them are just hit'n run visitors.
With BlogUpp!, you can turn those bouncing visits into targeted traffic, with ease. For every 10 unique visitors you get, your ad (your blog's t Read more:Visitors
, Targeted Traffic
Testing Your Imagination — How Many Worlds Do You Know? 2008-04-18 20:41:00 The greatest thing about reading books or playing computer games is that I can discover new worlds. Whole new worlds, kingdoms of Might and Magic, unknown realms waiting for me to explore... Probably that's why it takes so long to me to read a book. I like to imagine the scenery in details. Especially in the case of books.
Perhaps that's why my favorite is Middle Earth. I didn't play the game (Shadows of Angmar), so all I know is what I read in Tolkien's books.
But it's easier if things are given, so you don't have to imagine the whole world. Of course, it's not the same without fantasy, but there are worlds that are so well designed, you have to love it. One of my favorites is the World of Warcraft. It has a nice history from the previous Warcraft games, it is very well designed in WoW, i Read more:Testing
, Worlds
Catch Me If You Can — The Art of Remaining Anonymous 2008-04-12 02:55:00 First of all, don't even bother to think about committing some kind of a major internet-crime. You'll get caught. If you're reading this article, well, you can assume that there's no really secure way to hide yourself. ISPs log everything. Well, there are certain things you can do, but if you have the knowledge to perfectly cloak your IP, then why bother reading on?
Actually, why even bother trying to surf the web anonymously? Well, there are certain sites that simply won't let you in, if you're, say, from India. Or, you can get banned from a site. Or, you can simply be paranoid.
First, you might want to get rid of your (browser's) cookies. If you're using Firefox, you better create a new profile, so you don't need to delete your cookies. Then, if you want to hide your browser's identity, Read more:Catch
Digg AutoFriend Userscript 2008-04-11 16:21:00 I've created a userscript that makes it easier to add friends on digg.com. It adds a link (the (+) on the image below). You just click on the link and it clicks all the Friend buttons for you. Here's a link to the userscripts page, just click on the 'Install this script' button.
Still not a perfect version, but it makes life a bit easier for me.
Feel free to add me:
EDIT: This script violates the Digg
Terms Of Use, and I don't recommend it to anyone, unless you're trying to get your account banned. I am removing it from userscripts.org to prevent any further damage. Contact me if you need more info on this topic.
VCO Hack — or is it? 2008-04-10 20:40:00 I don't know if can see it, it's kinda bad quality... I'll upload to Google Videos later. Or if I make a useful copy.
Blog Update 2008-04-09 03:30:00 I've updated a few things on my blog, just to mention it:
A nice blue icon (blue blogger icon)
Online Users indicator
Submitted to BlogCatalog
Read more:Update
Battle for Wesnoth 1.4.1 Released! 2008-04-09 02:42:00 Have you ever played Battle
for Wesnoth? It's the most amazing open-source game I've ever seen. It's a turn-based strategy game with lots of campaigns, multiplayer mode, and you can even play online! It comes in quite many languages, and it's available for Windows, Mac OS X, (Open)Solaris and all flavours of GNU/Linux.
If you liked the game Heroes of Might and Magic, you'll sure like this open-source strategy!
MapleStory Firefox Extension (with EMS support) 2008-04-08 11:29:00 From now on, I will publish the applications here, my older blog MapleStory Tools is now officially closed. I won't re-publish the old apps here, if you're loking for them, pay a visit to my old blog, but don't expect any updates there. There's a MapleStory Firefox
extension and a Google Desktop Gadget, and also a stand-alone application (.exe).
I also have a working Firefox extension for Gaia Online, it can be found on the CheatEngine Forum. I still need to update a few things and fix a small bug, so if I find the time, I'll post the updates here. Read more:Extension
qBittorrent vs. Deluge 2008-04-08 11:00:00 There's a nice BitTorrent client named qBittorrent. Written in C++, using the Qt4 library. It's available for both Linux and Windows. It's under fast development, version 1.0 is to be released in the near future. I am proud to be their amd64 deb packager.
There's another nice client I have to mention — Deluge
. Written in Python, uses the GTK library. It's also available for Linux, Mac OS X and Windows. It has a nice plugin system, a web ui and a friendly community.
Both clients come in a whole bunch of languages, and have many features. They are easy to use, so any of you might want to give them a try.
Blog Design 2008-04-08 10:42:00 I'm finishing my blog template in a few days, If you like it, I can help you with designing your blog. Feel free to post a request for template/logo/gadget design, and if I like your blog, I might help you out :)
Read more:Blog Design
Welcome 2008-04-08 10:07:00 Welcome everyone.
I'm firing up my new blog. I've spent a few days designing the theme, it's still under development. I hope you like it.
Read more:Welcome
Blog Ranking Exploits 2008-05-05 04:01:00 An easy way to increase your blog's visibility is to submit to various blog-ranking websites. Still it's not much use if your blog's ranked like 12,000th of the 15,000. So clearly, you have to be on the top. But to achieve this, you have have visitors to vote for you, or at least visit your site to somewhat increase your ranking. That's sort of the catch on the whole ranking thing.
However, there are a few little tricks one can try to increase these rankings. For example, there are sites like BlogsOnTop, which rank blogs by their traffic, which is measured by a hardly noticeable little image somewhere on the bottom of the page. This can be pretty easily exploited: there are tons of popular forums and community sites that allow images in posts, or better yet, in signatures. You just write s Read more:Ranking
Highly Palindromic Primes 2008-05-07 12:48:00 For those of you who are interested in prime numbers, here's something (somewhat) new to explore: how palindromic a prime number is?
I've submitted two new sequences to Neil Sloane, the maintainer or the On-Line Encyclopedia of Integer Sequences, he'll post them in a few days, he said. The first one is the number of bases in which a prime p is palindromic, including unary (base 1) and base p-1, not counting bases > p (it would be a 1-digit palindrome in all larger bases). The most palindromic primes I've found so far are palindromic in 16 bases, the smallest such prime being 291721. Thus, a(25365) = 16.
291721 = 1·1291720 + 1·1291719 + ··· + 1·10
= 19·1222 + 73·1221 + 19·1220
Gaia Online AutoGrabber Extension — version 1.3 2008-05-11 06:08:00 Some of you have asked me to update my Firefox extension for Gaia Online, so here it is. Version 1.3 now checks all five Gaia pages where there is a daily reward, and automatically grabs the reward if it is available. Checks are done in random order, but now there's an options dialog that lets the user set the interval.
I didn't have the time to code a notification, so for now the extension just grabs the daily chances silently, without telling the user about it. The options dialog box can be reached through Firefox's menu: Tools | Add-ons | Gaia Gold Status | Options.
Install link: ggold-1.3.xpi
Screenshot:
Read more:Extension
, version
Blogs About Python 2008-05-17 16:04:00 I've found a few blogs about the Python
programming language. I knew about the most well-known web sites and forums, but the ones listed below are real, up-to-date blogs. Check them out if you like to read about my favorite, 'Avant-Garde' programming languages.
Just a little Python
This one I found on Google. Seems good and understandable. The latest posts seem to be SQL-related, which I am par Read more:Blogs
rssHugger — Giving It a Try 2008-05-17 07:40:00 After a few weeks of blogging, I'm beginning to realize that people actually do subscribe to my feed. So now that I have a couple of dozen subscribers, I'm trying to make some more :)
So I found this site, rssHugger, which seems to be an easy way to promote my feed. I'll try it and leave a post here in a few days to let you know if is worth to register.
One thing I liked is that there's a top 100 Read more:Giving
I signed up for PPP! 2008-05-18 18:41:00 I don’t really know if it’s a good idea to monetize my blog, but guess what, I’ve signed up to PeyPerPost. I’ve heard a lot of things about this site, some good, some bad, but most of the stuff I read about it is really old. So I’ve decided to try it out for myself.
Before anything, I must say that I have never, ever made money online, not a single buck. The only thing I’ve earned is a
EC Contest: Sum of 1,000,000,000 Digits of Pi (π) 2008-05-23 05:14:00 I decided to host a contest here on my blog: The first person to calculate the sum of the first 1,000,000,000 digits of π (Pi, 3.141592...) and post it here will get 500 Entrecard Credits from me.
To be sure you don't misunderstand anything: You only need to sum the decimal digits of π: like, the sum of the first 10 digits = 41 (π ≈ 3.1415926535897932384, and 1+4+1+5+9+2+6+5+3+5 = 4 Read more:Contest
Google Treasure Hunt: A Python Approach 2008-05-22 17:27:00 Google has launched Google Treasure
Hunt 2008, a 'a puzzle contest designed to test yer problem-solving skills in computer science, networking, and low-level UNIX trivia', as they say on their blog.
As always, I was eager to try myself. At the time of writing this post, the first two challenges are available. I started with the second (more recent) one. I'm not going to post my solution here, I'll Read more:Google
, Python
EC Contest: Sum of 1,000,000,000 Digits of Pi (π) 2008-05-23 05:14:00 I decided to host a contest here on my blog: The first person to calculate the sum of the first 1,000,000,000 digits of π (Pi, 3.141592...) and post it here will get 500 Entrecard Credits from me.
To be sure you don't misunderstand anything: You only need to sum the decimal digits of π: like, the sum of the first 10 digits = 41 (π ≈ 3.1415926535897932384, and 1+4+1+5+9+2+6+5+3+5 = 4 Read more:Contest
Google Treasure Hunt: A Python Approach 2008-05-22 17:27:00 Google has launched Google Treasure
Hunt 2008, a 'a puzzle contest designed to test yer problem-solving skills in computer science, networking, and low-level UNIX trivia', as they say on their blog.
As always, I was eager to try myself. At the time of writing this post, the first two challenges are available. I started with the second (more recent) one. I'm not going to post my solution here, I'll Read more:Google
, Python
I Signed Up for PPP! 2008-05-18 18:41:00 I don’t really know if it’s a good idea to monetize my blog, but guess what, I’ve signed up to PeyPerPost. I’ve heard a lot of things about this site, some good, some bad, but most of the stuff I read about it is really old. So I’ve decided to try it out for myself.
Before anything, I must say that I have never, ever made money online, not a single buck. The only thing I’ve earned is a Read more:Signed
Blogs About Python 2008-05-17 16:04:00 I've found a few blogs about the Python
programming language. I knew about the most well-known web sites and forums, but the ones listed below are real, up-to-date blogs. Check them out if you like to read about my favorite, 'Avant-Garde' programming languages.
Just a little Python
This one I found on Google. Seems good and understandable. The latest posts seem to be SQL-related, which I am par Read more:Blogs
rssHugger — Giving It a Try 2008-05-17 07:40:00 After a few weeks of blogging, I'm beginning to realize that people actually do subscribe to my feed. So now that I have a couple of dozen subscribers, I'm trying to make some more :)
So I found this site, rssHugger, which seems to be an easy way to promote my feed. I'll try it and leave a post here in a few days to let you know if is worth to register.
One thing I liked is that there's a top 100 Read more:Giving
Gaia Online AutoGrabber Extension — version 1.3 2008-05-11 06:08:00 Some of you have asked me to update my Firefox extension for Gaia Online, so here it is. Version 1.3 now checks all five Gaia pages where there is a daily reward, and automatically grabs the reward if it is available. Checks are done in random order, but now there's an options dialog that lets the user set the interval.
I didn't have the time to code a notification, so for now the extension just g Read more:Extension
, version
Highly Palindromic Primes 2008-05-07 12:48:00 For those of you who are interested in prime numbers, here's something (somewhat) new to explore: how palindromic a prime number is?
I've submitted two new sequences to Neil Sloane, the maintainer or the On-Line Encyclopedia of Integer Sequences, he'll post them in a few days, he said. The first one is the number of bases in which a prime p is palindromic, including unary (base 1) and base p-1, no
Blog Ranking Exploits 2008-05-05 04:01:00 An easy way to increase your blog's visibility is to submit to various blog-ranking websites. Still it's not much use if your blog's ranked like 12,000th of the 15,000. So clearly, you have to be on the top. But to achieve this, you have have visitors to vote for you, or at least visit your site to somewhat increase your ranking. That's sort of the catch on the whole ranking thing.
However, there Read more:Ranking
The First 140,000 Palindromic Primes 2008-04-21 08:59:00 For all you out there who are interested in prime numbers (hey, primes are fun, aren't they?), I have uploaded a list of the first 140,000 palindromic primes (sequence A002385 in OEIS). Actually, there's slightly more than 140,000. Here's a download link if you want to take a look (it's uncompressed, almost 2 Mb). I'll calculate all the 15-digit long palindromic primes in a few days, I'll post a l Read more:First
Recommend Site To A Friend
