Tuesday, 13 January 2009

Flash Fiction: Homage to '253'

Homage to '253'
Nathan Ryder

Martin Reed
Outward appearance
Black suit, open collar, striped sweater wobbling on the line dividing trendy and nerdy. His hair, too short to do anything with, too long to look tidy. He pushes his glasses up (slightly too big), staring intently at a document. His other arm is slung protectively around a backpack resting on his knees.

Inside information
Martin isn't reading the paper on tutoring strategies. He looks through it. All he can think about is the growing feeling that something is now not right in his eight month relationship. Trying – and failing – to identify what is wrong now he has come to a conclusion: he must break up with Emily before they both end up hurt.

What they are thinking or doing
It's not you it's me. No, he tells himself, you can't say that after eight months.

I just feel like our lives are going in different directions; I don't want to hurt you. Well, the last part is true...

The announcer's voice mumbles the next station. Martin wakes from his thoughts and shakes his head. Putting the paper away he thinks about work.

That lasts a second, then he begins to think about Emily. What happened? What am I not getting?

Stepping off the train he clumsily drops his wallet. Picking it up he goes to take his ticket out and instead pulls out the picture of Emily that he keeps there.

Smiling eyes, her shy grin.

In a second he realises: the next step.

Walking away he rehearses in his mind, I love you. Will you marry me?

*
Creative Commons License
This short story is released under a Creative Commons Attribution-Noncommercial-No Derivative Works License. Feel free to repost and share it with others, so long as you credit me (Nathan Ryder, 2009) as the original author and link back to this page. It would also be nice if you dropped me a comment!

Monday, 12 January 2009

Flash Fiction: ...And I Feel Fine

...And I Feel Fine
Nathan Ryder

From: Carolyn Webster, Senior Tour Supervisor
FAO: All Museum Tour Staff

Tour Guide Assistance Notes for “The End of the World! (as we know it!)” 28.05.19
  1. Emphasise, when talking with visitors, that this is the latest in a long series of state of the art multimedia experiences for visitors at the Museum.
  2. Emphasise especially that the exhibition is free; make special mention of the well stocked Museum Gift Shop.
  3. Use of recording devices of any kind is strictly prohibited in all exhibition spaces. Storage capsules are available for a small refundable deposit in the cloakroom adjacent to the Gift Shop.
  4. The Museum's legal division is certain that we are perfectly within our rights – through public domain, fair use and parody laws – to use the media that we have in our exhibitions. That said, all Museum staff will use the assigned exhibit names when leading tour groups and when dealing with questions from members of the public. Regardless of how a member of the public refers to an exhibit, you will use the name given in the official tour programme.
  5. If you believe that there are any questions that have not been raised in this outline, or if a member of the public asks you a question that you do not feel qualified to answer, please refer to a more senior member of the Museum Tour Staff.


From: Carolyn Webster, Senior Tour Supervisor
FAO: All Museum Tour Staff

Addendum #1 30.05.19
Having mentioned similar in point 4 of the original Tour Guide Assistance Notes, it pains me to reiterate the point for certain members of staff. Despite members of the public referring to it by another name, you are to refer to the exhibit “Post-Civilisation Simian Earth” by that name and by that name only.


From: Carolyn Webster, Senior Tour Supervisor
FAO: All Museum Tour Staff

Addendum #2 03.06.19
Any resemblance between the appearance of the lead character solidgram in “Post-Civilisation Simian Earth” and “Viral Neo-Luddite Earth (circa 1971)” is purely coincidental. DO NOT get drawn into conversations on the subject. DO NOT acknowledge or mention the name Charlton Heston. Refer all queries to myself or another senior member of the Museum Tour Staff.


From: Carolyn Webster, Senior Tour Supervisor
FAO: All Museum Tour Staff

Addendum #3 11.06.19
Following an incident during the first school tour of the day, access to the “Reanimation Station Military Base!” exhibit is limited to members of Museum Technical Personnel. Any queries by members of the public or by “journalists” should be met with a request to contact me.


From: Carolyn Webster, Senior Tour Supervisor
FAO: All Museum Tour Staff

Addendum #4 15.06.19
The “Reanimation Station Military Base!” exhibit has reopened. No school tours or individuals under the age of 18 are to be allowed access to the exhibit. All staff and members of the public should respect the yellow lines on the floor and endeavour to stay clear of them. No one should cross the red lines painted on the floor, and in the event that a member of the public does cross a line, Museum Tour Staff should:
  1. Order them to return;
  2. Not follow them;
  3. Alert members of Museum Security and Technical Personnel.
Museum Technical Personnel have assured me that while they cannot find the fault which lead to the injuries during the school tour four days ago, the solidgrams are restricted by the angle of the beam emitters from passing the red lines. Probably. They definitely cannot pass the yellow lines. All inquiries regarding the school tour incident of 11.06.19 should be forwarded to myself or another member of senior Museum Tour Staff.


From: Carolyn Webster, Senior Tour Supervisor
FAO: All Museum Tour Staff

16.06.19
VIRAL INTRUSION OF SOLIDGRAM SOFTWARE!!! LEAVE VIA EMERGENCY EXITS OR MAKE YOUR WAY TO THE MAIN SECURITY DESK!!! MUSEUM WILL BE SEALED IN FIVE MINUTES, ALL DATA AND POWER LINES WILL BE SEVERED WHILE INFORMATION SYSTEMS ARE PURGED, SAFETY WITHIN THE MUSEUM COMPLEX CANNOT BE GUARANTEED!!!


From: Carolyn Webster, Senior Tour Supervisor
FAO: Museum Board of Trustees

Autotyped from dictation, 18.06.19
I was left a project to supervise that I didn't want, that, that no one wanted. And yet your response at the start of this was, “No worries, Carolyn is always up for a challenge, Carolyn always comes through!”

You didn't listen on the 11th, you just wanted the story to go away.

You didn't listen on the 14th, you just looked at the margins. What do they look like now?

You can find yourself someone else to ignore. Consider this my resignation.


From: Carolyn Webster, Senior Tour Supervisor (former)
FAO: All Museum Tour Staff (those remaining)

Autotyped from dictation, 18.06.19
This should be Addendum #5 I think, my last message to you doesn't count. I always liked things to be regimented. Sorry if any of you thought I was a stuck up bitch for being such a stickler for the rules. I've resigned. The tours are all cancelled, the whole exhibition is to be closed. I was accused of cutting corners, but I didn't design this exhibition I just took over the project.

You only have to look at half of the things that the exhibits were based on to know that it was never going to end well. I am sorry that I couldn't persuade the Trustees to close the exhibition sooner; they'll say that we – that I – should have stepped in sooner on the day. I know it wasn't enough, please believe me that I did everything I could.
CW

*
Creative Commons License
This short story is released under a Creative Commons Attribution-Noncommercial-No Derivative Works License. Feel free to repost and share it with others, so long as you credit me (Nathan Ryder, 2009) as the original author and link back to this page. It would also be nice if you dropped me a comment!

Project Euler, Problems 4, 15 and 35

Do I have a life? Apparently not... Over the weekend and then this morning I spent some time working on some more problems with Project Euler. Saturday and Sunday were pretty quiet days all in all I suppose, and am still waiting to hear about a new work project. May as well spend the time learning a bit of C++ and keeping my mind active.

Problem 4
Find the largest palindromic number that results from multiplying two 3-digit numbers together. This was quite straightforward; iterating for the two 3-digit factors it just meant I had to write a couple of very short scripts that could recognise palindromic numbers. This meant making two slightly different routines, one for 5-digit numbers and one for 6-digit numbers.
After that it was just making sure that the largest number was carried out as a result.

Problem 15
Starting in the top left corner of a 2×2 grid, there are 6 routes (without backtracking) to the bottom right corner. How many routes are there through a 20×20 grid? There's a picture here to show what the routes are through the 2x2 grid if you can't picture what the question means. This didn't require a program, just a little thought back to some combinatorics that I did at uni. The numbers were pretty big, too big for the computer's calculator at first; a bit of pencil and paper cancelling of factors got me there soon enough.

Problem 35
How many circular primes are there below one million? Go here to see what is meant by the term circular prime. This took a little time to arrive at an algorithmic solution. I started off by thinking in terms of the restrictions that are placed on a number if it is a circular prime. Once we move out of single digits the only digits that can be in a number are 1, 3, 7 and 9, which limits greatly the number of numbers that we would have to consider.

However, my understanding of how to permute things in C++ is not quite there yet (I could do it with no problem in Maple). In the end I went with a brute force approach: tell the program to consider the number and the circular numbers that result. Then if all of these are prime then add 1 to the total.

Inelegant if I'm honest, but it did the job.

This now takes the total to twelve! Am slightly amazed by how many I've done since the New Year. Here's hoping that I am picking up enough C++ basics for when I start to work on harder projects. Thirteen to go...

Haiku

Hold your hand, squeeze it.
A raindrop - no, a tear.
Late winter; you leave.

I wait, sigh daily:
Flick-flick, change the show, quick-quick.
The news stays the same.

The end of winter,
A century late; time pauses,
Spring unsprung, for now.

These all came about in the normal way that I write haiku: I sit there thinking about a first line, five syllables that will make some kind of sense. Once I have those I think about how I can finish that off until something which sounds right has come to me. If possible I try to get some reference to passing time in. I'm not sure why exactly, but it just seems appropriate.

The following was something that just came to me after I ate at Yo!Sushi for the first time last week.

Oh pumpkin croquette!
Are you traditional fayre?
Hmm; yum! I don't care!

It is what it is, that's all I'm going to say on the matter...

Saturday, 10 January 2009

Project Euler, Problems 7 and 41

I put together a simple program in C++ that checks out whether or not a number is prime, i.e., whether or not it has any factors besides itself and 1. It was eventually writing a separate thing for this that helped me out, as despite what I'd learned in the past I was trying to make one program to do everything that was needed for the actual problem. Bad idea. Things are so much simpler if you break things up into their component parts...

Problem 7
Find the 10001st prime number. Once I had the program for checking whether or not a number is prime this was quite straightforward. I started off with knowing that 2 is the 1st prime number, and then working through all of the odd numbers after that and adding one to the tally every time that I found one.

Problem 41
What is the largest n-digit pandigital prime that exists? This was a little trickier, but not much more. It just took a bit of thinking. Firstly, what is a pandigital number? Well, a 5-digit pandigital number is, for example, 34251, a number which contains the first five digits once and once only. A 4-digit pandigital would be 4123 or 1234 or 3142, and so on. After a little thought, it occured to me that there cannot be 8- or 9-digit pandigital primes (if you're reading this Matt, do you know how/why that occurred to me?) and that the largest possible would be a 7-digit pandigital number, i.e., one that contained all the digits from one to seven.

It was then straightforward to think that it was most sensible to start searching from the extreme end of the numbers, 7654321, and to put conditions on the numbers; one only wants to check without 8, 9 or 0 in, one doesn't want duplicates of digits... Once I'd written those conditions in to the program, it was fine.

This takes my total of problems solved to nine. Sixteen to go. Might get one more done this weekend. It's good to keep thinking, and it also gives me a chance to keep learning bits and pieces of C++.

Keep learning people, it's the thing to do!

Tuesday, 6 January 2009

Flash Fiction: Ethical Conditions

Ethical Conditions
Nathan Ryder

There are two or three of Them outside right now. I can hear that high-pitched chiming that they make. I guess it's Their way of talking or something. I don't know.
I wish I had paid more attention in school. I hated science. I didn't care. I wish I knew more about it now. I might know where I am, or know how to figure it out. The stars look wrong. There are so few. I only know that because Mary told me. I'm so stupid.
I might know how They can float, how They can build these things which look like houses but aren't, how They can make me sleep just by looking at me...
...I might know what this thing, this machine, that They've put in my side is, and why I hurt after They have visited. I always sleep when they come. They just look at me, I think – it's difficult to know if that area of their skin is an eye – and it happens, I just black out. I always hurt after, but it goes away quickly.

The house is alright I guess, for a prison. It's warm, there's food and water, and I guess they sampled our radio, or maybe just took a recording of the internet and filtered out some music, because I haven't heard the same show twice so far.
Mary lives in the next house, with three other women. There are no other women in my house yet. She says she has been here for two years, give or take. She tried marking the days off on one of the walls, but every time she woke up the house was like brand new. She tried marking the days on paper, but it was the same, every time she woke up the house was renewed. All of the other women say the same thing happens to them, but between them try to keep a calendar. I don't care. I just want to go home.

A week or so ago, I walked out, kept going for four days. There were endless houses, all identical to mine, all off the same road. The women I met had similar stories. The day came around when they put me to sleep. They found me, like clockwork, and when I woke up I was back in my house. Mary said she tried it. They always find her.

I haven't seen a man since I arrived.

I look out of the window, and see Them looking up. The usual one points at me and then turns back to the other one. I duck away, fearful that He or They might be about to do me some harm.
I want to go home. My name is Nicola Smith. I'm twenty-two years old and I don't know why They are keeping me here. This is bullshit. It's been months now. Why am I writing this? The paper will be like new just as soon as I go to sleep anyway.

*

"Do you admit that there is a conflict of interest?"
The reporter won't get off that track, and I can hear the judgement in his tonal shifts; the telepresent public relation tell me to give him the standard response.
"Since we haven't been able to make them understand our language, or even train them in more than a basic way with regard to our intentions I agree that we have to tread carefully. But make no mistake, these are animals," I begin, pause, and then continue, "Social animals, yes, but they're barbaric, warlike, highly suspicious of other tribes. Keeping them here is an act of kindness-"
"They're sentient," the reporter says, "Early tests on them-"
"-were flawed," I say sharply, cutting in and giving the impression that the reporter had better not cut across my statements again. It's all so carefully scripted, and I'm bored, I have other work to do. "Long term observations of them in their natural habitat showed that they do not learn with time. As time moves on they become even more rigid and tribalised, a flaw on their social constructions that grows hungry for destruction. Coupled with the imminent atmospheric collapse, keeping this group is necessary for the sake of the Quadrant's Biosphere Specimen Archive."
The public relations whisper away at me on the closed channel. They're bored too, and give me permission to take my pick of the closing statements.
"As for their caviar," I conclude, pointing the way to him, "It is a luxury item and the profits from its sale supports the energy cost for their habitat. You might think it is a terrible thing, but I assure you we operate under the strictest of ethical conditions, approved by the Quadrant Consensus."
He gives a gesture that is easy to take as a shrug; he doesn't really care, his righteousness is an act. This is a puff piece for his news service, all of us know it. No one wants to really debate this any more. He travels ahead, still surveying and recording. The telepresence is disabled, science staff offline.
I glance back and see that one from the latest batch looking down.
I check the records and realise that she is alone in her dwelling. The new annexe is waiting to be filled with the next hundred thousand who are arriving, but I'm sure I can allocate one or two dwelling mates for her.
I really wish public relation would talk directly to the reporters, even if the reporters are only vaguely interested. Animal husbandry is my area, not ethics.
I look up and see that the female is gone from the window, and move off to catch up with the reporter.

*
Creative Commons License
This short story is released under a Creative Commons Attribution-Noncommercial-No Derivative Works License. Feel free to repost and share it with others, so long as you credit me (Nathan Ryder, 2009) as the original author and link back to this page. It would also be nice if you dropped me a comment!

Project Euler, Problem 79

I decided to take another look at some of the problems over on Project Euler, and number 79 jumped out at me yesterday evening when I saw it. Within about ten minutes I had an approach, and in less than ten minutes after that I had a solution. No explicit calculations or anything like that required, just a bit of logical thought.

Here's the problem as stated:

"A common security method used for online banking is to ask the user for three random characters from a passcode. For example, if the passcode was 531278, they may asked for the 2nd, 3rd, and 5th characters; the expected reply would be: 317.

The text file, keylog.txt, contains fifty successful login attempts.

Given that the three characters are always asked for in order, analyse the file so as to determine the shortest possible secret passcode of unknown length."

Now, I'm not going to go into all the details of it, but my approach was as follows: delete any duplicates, they won't tell you anything new; since none of the entries contain multiple copies of digits and we're looking for the shortest possible passcode, assume that there is only one instance of a digit in the code; then simply look, it's not that hard after that to deduce what the correct answer is.

This takes my total of completed problems on Project Euler to seven. Only another eighteen to go, and I think I've about reached my limit of problems that can be solved with pen and paper or by inspection. There are several others I've made inroads on by considering what the problem is actually asking, but they'll all require some computer assistance and practice of C++.

Which is cool!