For the maths-savy out there, this is a fine example of a 404 message. Awesome!

" I wish to have a job where I can sit all day and still have a salary " said the 9 years old me not really considering the consequences. 11 years old later, here I am with *a dream come true* along with a constantly killing back and knees pain at my 20's writing some java codes.

As a computer scientist I lie sometimes about my mojor to avoid any question related to computers...

It's when you lack electricity that you really start to question your life style

"Intense coding. A day passes. Wait, how the fuck did my code work? It doesn't make any sense!"

It happens so, so often, God why 😐

Give Job

If i had a dollar for each time I promised myself to actually work, I wouldn't have to work for the rest of my life...

Started working as a developer about 2 months ago and on the first day of of work I was tought how to make coffee.

I couldn't understand why is coffee so important to the everyone in the company. I didn't drink the coffee for the first 2 week.

Now after many sleepless nights spent coding i then realise why the people worship the drink so much.

People get very pissed when they go to coffee machine and find that there is no coffee then the last person to have a cup is going to be shouted at and at times even get insulted.

Now coffee is my fuel and cant do much without it.

Started my new job as a devops engineer, its been al month and i have never seen the seen of aws console or travis ci, dont even have credentials for any company cloud services.

I guess i should change my job title to backend dev

Do well in my first job as a dev. Very excited. 😜😜

Didn't even ask for 2 sets, the devRant team is just awesome! Thanks!

On and @localhost, it seems like people are sending their setup, so here's my student one :)

Maybe I'm severely misunderstanding set theory. Hear me out though.

Let f equal the set of all fibonacci numbers, and p equal the set of all primes.

If the density of primes is a function of the number of *multiples* of all primes under n,
then the *number of primes* or density should shrink as n increases, at an ever increasing rate
greater than the density of the number of fibonacci numbers below n.

That means as n grows, the relative density of f to p should grow as well.
At sufficiently large n, the density of p is zero (prime number theorem), not just absolutely, but relative to f as well. The density of f is therefore an upper limit of the density of p.

And the density of p given some sufficiently large n, is therefore also a lower limit on the density of f.

And that therefore the density of p must also be the upper limit on the density of the subset of primes that are Fibonacci numbers.

WHICH MEANS at sufficiently large values of n, there are either NO Fibonacci primes (the functions diverge), and therefore the set of Fibonacci primes is *finite*, OR the density of primes given n in the prime number theorem
*never* truly reaches zero, meaning the primes are in fact infinite.

Proving the Fibonacci primes are infinite, therefore would prove that the prime number line ends (fat chance). While proving the primes are infinite, proves the Fibonacci primes are finite in quantity.

And because the number of primes has been proven time and again to be infinite, as far back as 300BC,the Fibonacci primes MUST be finite.

QED.

If I've made a mistake, I'd like to know.

I just finished my second semester of computer programming. I then say to myself : "Let's use my new knowledge to make the program I worked on for fun two years ago better and more efficient!".

It was a bad idea.

Is learning VIM worth it?

I have some (probably unjustified) prejudices to it - I find it rather visually unattractive. But it seems to me also that it boosts productivity.

So do you recommend it and what is least painful way to learn it?

Dear community,

Could you please recommend me some (free if possible) sites for SW skill assessment (for example: sites with quizzes, problems, exams etc.)?

Thanks. :)

Wherein I disprove Goldbachs Conjecture (in one specific case)

golbach conjecture:
every even number is the sum of two primes

lets call the primes p and q

lets call our even number p+q=n

we can go further by establishing two additional variables

u=p-1, v=q-1

therefore every even number is the sum of u+v+2, according to goldbach's own reasoning.

in the simplest case...

p=2, q=2, p+q=4

u=1, v=1, u+v+2 = 4

We can therefore make a further conjecture in the simplest case every sum of two primes, less 2, is the sum of two composites. This likely has connections to the abc conjecture for a variety of reasons. But leaving ancillary discussion aside for a moment...

We can generalize to a statement that every even number is the sum of two odd numbers. And every odd number greater than 1 is the sum of an odd number and an even number.

Finding an even number that is not the sum of (p-1)+(q-1) would therefore be equivalent to disproving the goldbach conjecture. Likewise proving every even number is the sum of (p-1)+(q-1) would be the equivalent of proving it.

Proving all even numbers greater than 2 are the sum of two composites + 2 would be proof of goldbachs conjecture, and finding any example or an equation that proves an example exists such that *some* subset of even numbers are NOT the sum of two composites +2, would disprove the conjecture.

Lets start with a simple example:

2+2=4

because 4-2=2, and two is not the sum of two composite numbers goldbachs conjecture must ipso facto be false.

QED

If I've wildly misapprehended the math, please, somebody who is better at it, correct me.

Honestly if this is actually anything, I'd be floored to discover no one has stumbled on this line of reasoning before.

Started my very first (summer) job as an IT agent in customer service for my city less than two weeks ago and finally moving out from the formations to answer the phone alone.

I must've listened to around 30 calls and already there's stories I could make tales of.

I now understand the job of customer service.

Hi guys any tips and tricks on how to become the best full -stack dev.

In recent time, I'm thinking about to start freelancing (or at least start preparing for it).

Problem is that I'm completely new to it. In following weeks, which steps should I take to successfully introduce myself to that market? Which mistakes to avoid? Which sites do you recommend?

Thanks in advance for contribution. :)

How do you know that you are stuck in a job without longterm perspective (besides some undefined gut feeling)?

And what to do then? It seems to me, only possible action is to change job. Is there any, less extreme, alternative?

Not dev related, assuming that here is a lot of people interested in history , philosophy, books I would like to ask for recommendations for:
YouTube channels or site related to history, books reviews/recommendations (dev and non-dev related), philosophy.

Thanks. :)

I keep getting emails from people I don't know that are like conversations, leading me to believe they aren't sent to the rightful owner. Most of the time, I see the email has uppercase at some places (when mine doesn't).

I just wish the companies could put a mark somewhere in their page when entering an uppercase email that mentions the fact that it doesn't change shit, getting really annoyed from receiving these mails not directed to me 😒

I have failed my computer organization and architecture module because i didn't understand assembly language.
Anyone with links to the best x86 assembly programming please share.

What do you think about Udemy?

And if you took it, which courses did you find most useful - not only related to programming/development but in general?

Thank you in advance. :)

I need recommendation for site/community to improve my (clean) code style?

And, in more general, what are your ways to improve code style and programming way of thinking - more oriented towards bigger picture of application/systems (patterns, architecture, etc.)?

Third year cs student. Cant wait to get started

I need some recommendation for Web UI components framework which could be relativity easily integrated/used on Play framework web application.

Something like Primefaces or old Richfaces (but those are for JSF).

Thanks in advance. :)