If you run this, you will find the number is not divisible by 3 and the isprime() function returns "True", indicating that this number is indeed a prime number.
If you run the same code and replace the 7 with a 1, you will find that the resulting number is NOT a prime number.
I have written the following ugly Python script:
from sympy import *
s = "111111111111111111111111111111111111111111111111111111111111 111111111111111111111111111111111111111111111111111111111111 111111111111111111111111111111111111111111111111111111111111 111111111111111111111111111111111111111111111111111111111111 111111111111111111111111111111111111111111111111111111111111 111111111111111111111111111111111111111111111111111111111111 111111111111188888888888111111111111111111888811111111111111 111111111111118888888888881111111111111188888111111111111111 111111111111111888811118888111111111118888811111111111111111 111111111111111118888111888811111111188881111111111111117111 111111111111111111888811188888111118888811111111111111111111 111111111111111111188888111888811888881111111111111111111111 111111111111111111111888811188888888111111111111111111111111 111111111111111111111188881118888811111111111111111111111111 111111111111111111111118888811188881111111111111111111111111 111111111111111111111111188881118888811111111111111111111111 111111111111111111111111188888811188881111111111111111111111 111111111111111111111118888888881118888111111111111111111111 111111111111111111111888881118888111888881111111111111111111 111111111111111111118888111111888881118888111111111111111111 111111111111111111888881111111118888111888811111111111111111 111111111111111188888111111111111888811118888111111111111111 111111111111118888811111111111111188888888888811111111111111 111111111111188881111111111111111111888888888881111111111111 111111111111111111111111111111111111111111111111111111111111 111111111111111111111111111111111111111111111111111111111111 111111111111111111111111111111111111111111111111111111111111 111111111111111111111111111111111111111111111111111111111111 111111111111111111111111111111111111111111111111111111111111 111111111111111111111111111111111111111111111111111111111111"
s = s.replace(" ", "")
x = int(s)
xs = 0 for c in s: xs += int(c)
print(xs) print(xs/3)
print(isprime(x))
If you run this, you will find the number is not divisible by 3 and the isprime() function returns "True", indicating that this number is indeed a prime number.
If you run the same code and replace the 7 with a 1, you will find that the resulting number is NOT a prime number.
Itβs nice to see another coder out there!
There are dozens of us, Dozens! We should all connect and build some alt-tech.
I am working on a few project to help people build passive income.
I've been working on some drop in architecture on AWS for AI Recruiting.
Of the companies that make up the S&P 100, 97 of those companies reported their new hires by race.
Only 4.5% of those new hires were white, Caucasian. In a country where 62-64% of people are Caucasians.
White people are facing systematic discrimination by Soros and Fink (Blackrock)
We have to collect intelligence on companies doing this, save that, and sue the pants off these racists.