Accept who I am and love me

## Building a Hi-Fi system

### By Maurice Ticas

Hardware and software are put together to build something of practical use. Building a system with hardware and software is an engineering effort worthy of pride. In recent times--with the proliferation of Apple, Google, and Microsoft products--we are encouraged to forget about doing such engineering work for sake of convenience. The big companies have taken all the fun and pride from building systems. Why cook at all when you can go out to eat for every meal when hungry? The same question as it relates to hardware and software can be asked: Why build a system when you can just always look outside of your creative powers to obtain it.

This post will describe the Do-It-Yourself project of building a hi fidelity audio system. We will make note of the hardware and software used to build it. If not an audiophile already, this engineering project will perhaps turn you into one.

Comment, bookmark, or share Building a Hi-Fi system

There are 0 comments. No more than five will be allowed.

## Compute Secolinsky

### By Maurice Ticas

We look back at all the available math content that Secolinsky offers on the web. Its targeted readership primarily are those who have a maturity in mathematics acquired from persistently doing it over time. With patience, the reader learns to appreciate the subtletiies and the myriad nuances when thinking mathematically. This small collection of Secolinsky Publications invites you to do and think mathematics.

There are a few Secolinsky Publications that are not PDF documents, but are natively rendered in the browser. In such cases, only the Mozilla's Firefox browser is supported since they are the only browser we trust to natively typeset mathematics.

As we enter 2017, here is a fun post about what can be said about the number 2,017. Cheers! And Happy New Years!

Comment, bookmark, or share Compute Secolinsky

There are 0 comments. No more than five will be allowed.

## Recursion in Scheme

### By Maurice Ticas

As promised from the "Update" Febuary 6th post, we can now recur to produce the total number of triangles inside the $$n^{th}$$ iteration of the Sierpinski triangle using the code below written in Scheme.

 1 2 3 4 5 (define sierpinski (lambda (n) (cond ((zero? n) 1) (else (+ 1 (* 3 (sierpinski(- n 1)))))))) 

To do the recursion on your computer, install mit-scheme, then copy and paste the code to your mit-scheme implementation. You then will be able to call the function for any desirable $$n$$. Now go ahead and recur!