an t-aonú lá don wombat ar scoil

Thosaigh mé ar scoil inniu. Bhí mé iontach neirbhíseach, agus ní raibh ach uair amháin codlata agam aréir. Ach bhí na daoine go léir cairdiúil, agus tá mé réasúnta suaimhneach anois.

I started school today. I was very nervous, and I only got one hour of sleep last night. But everyone was very friendly, and I'm much more relaxed now.

Scoil

Ar naoi mbliana is dhá scór d'aois, tá mé ag dul ar ais ar scoil. Tosóidh mé De Luain. Ní bheidh mé ag freastal ar ranganna ar bith. Ina áit sin, beidh mé ag déanamh taighde chun céim mháistir a fháil (agus ansin, céim dhochtúra, le cúnamh Dé). Ábhar mo chuid taighde ná "intleacht shaorga". Ba mhaith liom na fionnachtana is nua ó thaighde intinne a chur le "líonra néarach" agus le "clárú géiniteach".

Is mór an t-athrú é sin, agus tá mé ar tinneall ar fad ag smaoineamh fá dtaobh de!

At age 49, I'm going back to school. I start Monday. I won't be attending classes. Instead, I'll be doing research for a master's degree (and hopefully a PhD after that). The subject of my research is artificial intelligence. I want to apply some of the latest findings from brain research to neural networks and genetic programming.

It's a big change, and I am a nervous wreck!

Haskell agus Tionscadal Euler #6

Seo an chéad phost sa tsraith seo.

Mo réiteach féin do uimhir a sé:

(sum [1..100])^2 - sum (map (\x -> x^2) [1..100])

Tá mé sásta leis. Níor chonaic mé réiteach is fearr liom ar an fóram.

If you're wondering what this is all about, here's the first post in this series.

Haskell agus Tionscadal Euler #5

Seo an chéad phost sa tsraith seo.

Mo réiteach féin do uimhir a cúig:

divisibleUpTo n 1 = True
divisibleUpTo n m = ((n `mod` m) == 0) && (n `divisibleUpTo` (m-1))

factors n = [m | m <- [1,2..floor(sqrt(fromIntegral n))], n `mod` m == 0]

prime n = null [m | m <- factors n, m > 1, m /= n]

lowestNumberDivisibleUpTo 1 = 1
lowestNumberDivisibleUpTo n = head [m | m <- [start..], m `divisibleUpTo` n]
    where start =  if prime n
                   then n * lowestNumberDivisibleUpTo (n-1)
                   else lowestNumberDivisibleUpTo (n-1)

main = print ( lowestNumberDivisibleUpTo 20 )

Bhí orm an "start" a úsáid mar bhí an cód ró-mhall gan é.

Fuair mé feabhsú níos giorra ar an fóram:

foldl (lcm) 1 [1..20]

If you're wondering what this is all about, here's the first post in this series.