theusx — zsh

$ whoami

theusX

|

$ cat about.txt

I build digital experiences with clean code and performance in mind. Stack: JS/TS, React, Node. Based in Brazil.

// 01 About

I work with the main programming languages and with networks, using systems such as Ubuntu, MikroTik, pfSense, Windows Server, and Cisco.

I design and project electrical systems: generation, transmission, automation projects, and everything in that area.

I'm also a developer focused on solutions that combine great UX with sustainable code, and I enjoy automating processes and infrastructure.

Outside of code, I'm into music, games, and coffee. Always open to tech conversations and new projects.

profile.ts
interface Dev {
  name: 'theusX';
  topLanguages: ['JavaScript', 'Python', 'Java', 'TypeScript', 'C#'];
  networks: true;
  systems: ['Ubuntu', 'MikroTik', 'pfSense', 'Windows Server', 'Cisco'];
  electrical: { generation: true, transmission: true, automation: true };
  coffee: true;
}

// 02 Stack

Frontend

HTML, CSS, JavaScript, TypeScript, React, accessibility and performance.

Backend / Tooling

Node.js, REST APIs, build tools and automation.

Networks & Systems

I work with networks and the top systems: Ubuntu, MikroTik, pfSense, Windows Server, Cisco.

Electrical systems

Design and projects: generation, transmission, automation, and the full scope of the area.

Other

Git, Linux, UX basics, deploy and best practices.

JavaScriptPythonJavaTypeScriptC# UbuntuMikroTikpfSenseWindows ServerCisco ReactNode.jsGitREST GenerationTransmissionAutomation

// ?? The Enigma

Compute the n-th prime number.

Given n ∈ ℕ, find p(n) = the n-th prime.

Required: a closed formula. No recursion. No “list all primes up to…”.

p(n).math
p(n) = ?

// Example: p(1)=2, p(2)=3, p(3)=5, p(4)=7, p(5)=11, ...
// Task: express p(n) in closed form.
// (No algorithm. No sieve. Formula only.)
_

If you know the answer, send it to contato@theusx.dev.

// 03 Contact

Open to opportunities and conversations. Virtual coffee works too.

oi@theusx.dev