Who is behind apple 📲🍎 I wonder? 🤔 maybe the same people that want to destroy #BTC 🤔 💭 
#[1] No one said that I can’t post my LND⚡️address in my bio. Zap me #Nostr copy->paste 
I just captured this! 🤯⚡️ zap ⚡️ zap ⚡️ zap #nostr #BTC https://nostr.build/av/9a0ce3ab4f512f175929bea7bf12d3fec8a010591b21984ed2ac2c0a4e8d4f51.mov
#[0] check out this CHAT GPT proof for the twin prime conjecture for P>5(mod6)
There are infinitely many prime numbers. This is a well-known result proven by the ancient Greek mathematician Euclid around 300 BCE. Euclid's proof is based on a technique called "proof by contradiction."
Assume that there are finitely many prime numbers, and let's denote them as p1, p2, p3, ..., pn. Now, consider the number N = p1 * p2 * p3 * ... * pn + 1. This number N is greater than any of the primes we initially listed.
Now, N can either be a prime number itself or composite. If N is prime, then it contradicts our assumption that we had listed all prime numbers up to pn. If N is composite, it must have prime factors. However, none of the primes p1, p2, ..., pn can be a factor of N because dividing N by any of them leaves a remainder of 1. This means that N has a prime factor that is not on our initial list, contradicting our assumption that we had all primes.
Since assuming a finite number of primes leads to a contradiction, we conclude that there must be infinitely many prime numbers.
Now let's discuss why there are infinitely many prime numbers congruent to 1 (mod 6) and infinitely many prime numbers congruent to 5 (mod 6).
Suppose we consider the product of prime numbers that are congruent to 1 (mod 6). For example, we can take the primes 7, 13, 19, 31, and so on. The product of these primes will also be congruent to 1 (mod 6). This is because multiplying numbers congruent to 1 (mod 6) will always result in a number congruent to 1 (mod 6).
Similarly, if we consider the product of prime numbers that are congruent to 5 (mod 6), such as 5, 11, 17, 23, and so on, the product will also be congruent to 5 (mod 6). This is because multiplying numbers congruent to 5 (mod 6) will always result in a number congruent to 5 (mod 6).
Since there are infinitely many prime numbers, and we can always find more primes congruent to 1 (mod 6) and primes congruent to 5 (mod 6), it follows that there are infinitely many such products congruent to 1 (mod 6) and infinitely many products congruent to 5 (mod 6).
Therefore, both the product of primes congruent to 1 (mod 6) and the product of primes congruent to 5 (mod 6) are infinite.
🚀 #btc to the moon 🌙 
This is how tyranny looks like, it’s a war no one’s is talking about #[1] #[3] #[4] #[5] #[6] ⚡️ #cryptowar #pleb 🆚 #king2.0 
#[0] make Damus Web resistant (Tor) like Telegram Web…we got our 🔑 keys 🔐 no one can take that away from us! Fight back! 💪 F… apple or google ⚡️ zap tyranny back ⚡️
#zap #zap #zap 
Good night Everyone! #[1] included! #nostr #hug 
Neon Lights Lenses 🖼️
#nightcafe.studio #art 
Almost there..All Blockchain synchronized 552 GB ,next step config of RTL and open channel ⚡️
Big Thanks to🙏 #[1] #BTC #nostr #zap 
Zap ⚡️ zap ⚡️ zap ⚡️
🤔⚡️🔫 💭 a real zapper… Bluetooth/wifi/RF, set the price on a LED and pay with a shot.. 😂