Skip to content
View 0xffset's full-sized avatar
😊
Studying
😊
Studying
Block or Report

Block or report 0xffset

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
0xffset/README.md

Привет , I'm 0xffset

Computer Student Student | Linux | Quantum Computing | Mathematics

rolEYder

21y/o Computer science student with interests in fields like Cybersecurity, Quantum Computing, and Mathematics.

// Fermat's last problem x^n+y^n=z^n
#!/usr/bin/perl
use strict;
use warnings;

sub fermat {
  my ($n) = @_;
  for (my $x = 0; $x < 100; $x++) {
  	for (my $y = 0; $y < $x+1; $y++) {
  		for (my $z = 0; $z < ($x**$n)+($y**$n) +1; $z++) {
  			if (($x**$n)+($y**$n) == ($z**$n)) {
  				print "$x^$n + $y^$n == $z^$n\n";		
  				}
  			}
  		} 
  }


my $e = fermat(5);

  • 🔭 Bachelor's degree in Computer Science and Mathematics
  • 🌱 I’m currently learning Number Theory
  • ⚙️ Mastering: .py, .cpp, .c, .perl, .java, .html, .css .s, .sh, .go

The Explicit Formula for the Prime Counting Function

Here is the significance of this equation, in English:

    Prime numbers are numbers that have no divisors other than 1 and themselves. The primes below 100 are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97. From this, it is already clear that there is no apparent pattern to the primes: in some runs of numbers you will get a lot of primes, in other runs you will find no primes, and whether a run has a lot of primes or no primes seems to be totally at random.
    
    For a very long time, mathematicians have been trying to find a pattern to the prime numbers. The equation above is an explicit function for the number of primes less than or equal to a given number.</p>

The Explicit Formula for the Prime Counting Function


Imagination is more important than knowledge. For while knowledge defines all we currently know and understand, imagination points to all we might yet discover and create.

Albert Einstein

Here's my favorite math stuff so far...

My favorite integral so far

Pinned

  1. BlueBerryMath BlueBerryMath Public

    Forked from faustotnc/BlueBerryMath

    An extensive math library written in Java.

    Java 1

  2. ARM-Assembly ARM-Assembly Public

    ARM Assembly programs

    Assembly 2

  3. x86-Assembly x86-Assembly Public

    A lot of x86-Assembly programs with C/C++

    Assembly

  4. Algorithms Algorithms Public

    Big-O complexity algorithms | Stack programming | Recursion

    Python 2

  5. MinesReact MinesReact Public

    Minesweeper Puzzle Game

    TypeScript 1

  6. Life-Maze Life-Maze Public

    A Conway's Game of Life Simulator

    TypeScript