Primes that are your pals!
I'm not a fan of threads that are just listing something of a web page, so I'm not going to leave a source list of palprimes.
GET is at 114232411
We are the most perfect numbers.
We are the most unique numbers around.
We are mathematically pure: Prime.
We are aesthetically pure: Palindrome.
We are the most perfect numbers.
The chosen few.
The elite.
We are Palindromic Primes.
..and roll two more d20s, take off the highest (roll of the first d20) and the lowest (second d20), and write that number in hexadecimal and append it to the username, then count in every single non-archived thread on r/counting, revive any thread on the alt and play hexario, then aggregate the current number and your hexario score, then take five digit segments of the number and if it's prime, count in kurdish, if it's divisible by three, count in spanish, if it's divisible by four, count in romanian, if it's divisible by five, count in afrikaans but put the written number followed by 'MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP MAPLE SYRUP' in Google Translate through every language and then to japanese, but then if you get a 00000 or 11111, add d20 to every digit and carry all the numbers over, but then roll 100 d20s, convert the number to base 64, and search it up in youtube, replacing each letter with an O until you get a result, then click on the first one to show up and link it in youtube, remembering to s p a c e o u t a l l t h e l e t t e r s. if your age in seconds is prime p l e a s e s p a c e o u t t h e c o u n t t o o, but if it's composite write 'BANaa anananaaanaANBNAABAANAAnANAAAAAAAAA NANAAbaABAANAABNAANAAAAAAAAAAAAaaaaaaAAAAAAAANAnaanaAaannanabanaaaanannanabanabaaababbaanaanabanabanabanabanaanabanbanaaabanbanbanbBANBAANBANBANBANABNABNAANBANANANANANANANANANNANAANANANAAAAAAAAAAAAAAANNAnbanbANBANABANBANBNAABNABANABABANBANABNANANANAaAaaaaaa...", but alongside all of that, if any of the /r/counting mods have a cakeday then ping u/urbul 1d20 times, if they don't ping them by 2d20 anyways. if at this current time your comment has a prime number of letters append 'i s u c k a s s' to your comment, if the cleveland browns have won this season go look at yourself again, because they can't win a single game, if they haven't won this calendar year like usual, multiply your count by 3d87, take the first hundred digits and put it to the front, and then ping u/urbul (roll of the d20) amount of times, if your FIFA team qualified for the world cup then write 'I AM A SOCCER NERD LA LA LA, FOOTBALL AROUND THe WORLD BA BA BAAAAA, IF
... keep reading on reddit ➡14084121123253364099143176719968020045833839646156765164693833854002086991767134199046335232112148041
https://paulnotebook.net/home/primes/palindromic-primes-base-ten/
I'm doing Python exercises and am attempting to print the first 100 instances of palindromic prime numbers (eg 383, 90709) - prime numbers which are also palindromes.
The code successfully returns the content requested, however I know the code is far from optimal. It takes ~30 seconds to reach the 100th instance (94049).
First, code:
def reverse(number):
rev = 0
while number != 0:
lastDigit = number % 10
number //= 10
rev = (rev * 10) + lastDigit
return rev
def isPrime(n):
div = 2
while div <= n / 2:
if n % div == 0: # if True number NOT prime
return False
div += 1
return True
def isPalindrome(num):
#num = str(num)
#return True if (num[::-1] == num) else False
return True if (reverse(num) == num) else False
def main():
count = 0
numToCheck = 1
while count < 100:
numToCheck += 1
if isPrime(numToCheck) and isPalindrome(numToCheck):
print('{:>5d} '.format(numToCheck), end='')
if (count + 1) % 10 == 0:
print()
count +=1
if __name__ == '__main__':
main()
Using Python 3.4 on Ubuntu 14 x64.
I know recursion and such can be very helpful in optimizing program speed, however I'm looking for some pointers on why this code is so slow, and from there I'll look into any suggested alternatives.
For example, in this code, which option is faster, the commented option or the uncommented option?
def isPalindrome(num):
#num = str(num)
#return True if (num[::-1] == num) else False
return True if (reverse(num) == num) else False
TL;DR: code above works, needs optimizing
https://www.amazon.com/primeday/ref=PD17_GW_US_ShopAll
Share links below of some of the coolest fest / camping gear you find!
What a difference eleven months can make.
My family and I have moved back in together. The lawyers are fired and the court case is closed. I put all my kids to bed every night, they wake me up every morning, and every day my wife and I tell each other, "I love you."
Here's the formula: [sobriety] + [intention] - [self-defeating defense mechanisms]. And that's the good news.
The other good news is yes, when something is out of my control and goes sideways, when the bad feelings come on strong, I think, "Beer can give these bad feelings instant death!"
It happened yesterday. The puppy died. My basal ganglia said, "Ten beer ought to do it." I marveled at the thought. I always do. It's like, "Boy, a paper cut! I'll never have another if I just cut off this finger."
Now it's very easy to look at it that way and feel the desire to drink fade out. Now I'd rather sit with the dead puppy blues. That there's the silver lining.
With you I will not drink today.
Do your worst!
For context I'm a Refuse Driver (Garbage man) & today I was on food waste. After I'd tipped I was checking the wagon for any defects when I spotted a lone pea balanced on the lifts.
I said "hey look, an escaPEA"
No one near me but it didn't half make me laugh for a good hour or so!
Edit: I can't believe how much this has blown up. Thank you everyone I've had a blast reading through the replies 😂
It really does, I swear!
