Niki N. Paxton
@paxton11.bsky.social
Science and physics freak, militant feminist, and all around pixie goddess.
Paxton's Wheel for Primes by Niki N. Paxton
p=[0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
while (1):
for i in range(3,20,2):
if (p[i]==0):
for j in range(i*3,20,i):
p[j]=1
print(" 1",/n," 2")
for k in range(3,20,2):
if (p[k]==0):
print(k)
p=[0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
while (1):
for i in range(3,20,2):
if (p[i]==0):
for j in range(i*3,20,i):
p[j]=1
print(" 1",/n," 2")
for k in range(3,20,2):
if (p[k]==0):
print(k)
November 28, 2025 at 9:48 AM
Paxton's Wheel for Primes by Niki N. Paxton
p=[0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
while (1):
for i in range(3,20,2):
if (p[i]==0):
for j in range(i*3,20,i):
p[j]=1
print(" 1",/n," 2")
for k in range(3,20,2):
if (p[k]==0):
print(k)
p=[0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
while (1):
for i in range(3,20,2):
if (p[i]==0):
for j in range(i*3,20,i):
p[j]=1
print(" 1",/n," 2")
for k in range(3,20,2):
if (p[k]==0):
print(k)
I finally managed to test my #code for my Paxton's Wheel
for #prime_numbers and it worked. I ended up using a
#raspberry P400 keyboard #computer and #coded in #python.
The next post will be the whole #method or #algorithm (ugh).
#Niki_codes.
for #prime_numbers and it worked. I ended up using a
#raspberry P400 keyboard #computer and #coded in #python.
The next post will be the whole #method or #algorithm (ugh).
#Niki_codes.
November 28, 2025 at 9:30 AM
I finally managed to test my #code for my Paxton's Wheel
for #prime_numbers and it worked. I ended up using a
#raspberry P400 keyboard #computer and #coded in #python.
The next post will be the whole #method or #algorithm (ugh).
#Niki_codes.
for #prime_numbers and it worked. I ended up using a
#raspberry P400 keyboard #computer and #coded in #python.
The next post will be the whole #method or #algorithm (ugh).
#Niki_codes.
A sweet nothing in my ear :
" I'll be your Ken, if you'll be my Barbie. "
" I'll be your Ken, if you'll be my Barbie. "
November 27, 2025 at 3:17 PM
A sweet nothing in my ear :
" I'll be your Ken, if you'll be my Barbie. "
" I'll be your Ken, if you'll be my Barbie. "
I am what I am and nothing more. I do not pretend to be
anything but what I am.
Niki Natalie Paxton, Nov. 27, 2025
anything but what I am.
Niki Natalie Paxton, Nov. 27, 2025
November 27, 2025 at 2:25 PM
I am what I am and nothing more. I do not pretend to be
anything but what I am.
Niki Natalie Paxton, Nov. 27, 2025
anything but what I am.
Niki Natalie Paxton, Nov. 27, 2025
I don't know if this is a thing already, but here goes...
Paxton's Principal on Primes: Every #coprime #number (non-prime) is a product of two or more #prime_numbers.
Because by defination, coprimes are multiples of two lower numbers besides 1. Any coprime factor can again be reduced
to primes.
Paxton's Principal on Primes: Every #coprime #number (non-prime) is a product of two or more #prime_numbers.
Because by defination, coprimes are multiples of two lower numbers besides 1. Any coprime factor can again be reduced
to primes.
November 26, 2025 at 6:39 AM
I don't know if this is a thing already, but here goes...
Paxton's Principal on Primes: Every #coprime #number (non-prime) is a product of two or more #prime_numbers.
Because by defination, coprimes are multiples of two lower numbers besides 1. Any coprime factor can again be reduced
to primes.
Paxton's Principal on Primes: Every #coprime #number (non-prime) is a product of two or more #prime_numbers.
Because by defination, coprimes are multiples of two lower numbers besides 1. Any coprime factor can again be reduced
to primes.
More on #paxtons_wheel for #prime_numbers.
I was thinking that for the outer FOR loop, you only
have to test up to the square root of n. If you go any
higher, you're just repeating likewise calculations (ie.
5*19 = 19*5, etc.) This would save a large amount of
processing. This is integer math.
I was thinking that for the outer FOR loop, you only
have to test up to the square root of n. If you go any
higher, you're just repeating likewise calculations (ie.
5*19 = 19*5, etc.) This would save a large amount of
processing. This is integer math.
November 25, 2025 at 3:41 AM
More on #paxtons_wheel for #prime_numbers.
I was thinking that for the outer FOR loop, you only
have to test up to the square root of n. If you go any
higher, you're just repeating likewise calculations (ie.
5*19 = 19*5, etc.) This would save a large amount of
processing. This is integer math.
I was thinking that for the outer FOR loop, you only
have to test up to the square root of n. If you go any
higher, you're just repeating likewise calculations (ie.
5*19 = 19*5, etc.) This would save a large amount of
processing. This is integer math.
Ya know...my Paxton's Wheel for #prime_numbers might have #crypto applications if #programming is proper and the #mathematics is so elementary that it's downright #silly that people buy #bitcoin and other #cryptocurrency. (See previous posts)
The Pixie Goddess
The Pixie Goddess
November 25, 2025 at 12:46 AM
Ya know...my Paxton's Wheel for #prime_numbers might have #crypto applications if #programming is proper and the #mathematics is so elementary that it's downright #silly that people buy #bitcoin and other #cryptocurrency. (See previous posts)
The Pixie Goddess
The Pixie Goddess
For Paxton's Wheel for #primes in #mathematics the
line p[0]*n is supposed to fill a list array with zeros.
It works on the idea that all coprimes (non-prime numbers) are at their basics products of prime numbers.
The code goes thru all the MULTIPLES of found primes to
find the PRIMES COMPLIMENT.
line p[0]*n is supposed to fill a list array with zeros.
It works on the idea that all coprimes (non-prime numbers) are at their basics products of prime numbers.
The code goes thru all the MULTIPLES of found primes to
find the PRIMES COMPLIMENT.
November 21, 2025 at 12:41 PM
For Paxton's Wheel for #primes in #mathematics the
line p[0]*n is supposed to fill a list array with zeros.
It works on the idea that all coprimes (non-prime numbers) are at their basics products of prime numbers.
The code goes thru all the MULTIPLES of found primes to
find the PRIMES COMPLIMENT.
line p[0]*n is supposed to fill a list array with zeros.
It works on the idea that all coprimes (non-prime numbers) are at their basics products of prime numbers.
The code goes thru all the MULTIPLES of found primes to
find the PRIMES COMPLIMENT.
Paxton's wheel for #prime_numbers in #mathematics
n=1000
p[0]*n
p[4]=1
while():
for x in range(3,n,2) :
if(p[x]==0) & (x*3<=n) :
for y in range(x*3,n,x) :
p[y]=1
print("1 2 ")
for x in range(3,n,2) :
if(p[x]==0) :
print(x)
ta,da, from the pixie goddess.
n=1000
p[0]*n
p[4]=1
while():
for x in range(3,n,2) :
if(p[x]==0) & (x*3<=n) :
for y in range(x*3,n,x) :
p[y]=1
print("1 2 ")
for x in range(3,n,2) :
if(p[x]==0) :
print(x)
ta,da, from the pixie goddess.
November 18, 2025 at 8:57 PM
Paxton's wheel for #prime_numbers in #mathematics
n=1000
p[0]*n
p[4]=1
while():
for x in range(3,n,2) :
if(p[x]==0) & (x*3<=n) :
for y in range(x*3,n,x) :
p[y]=1
print("1 2 ")
for x in range(3,n,2) :
if(p[x]==0) :
print(x)
ta,da, from the pixie goddess.
n=1000
p[0]*n
p[4]=1
while():
for x in range(3,n,2) :
if(p[x]==0) & (x*3<=n) :
for y in range(x*3,n,x) :
p[y]=1
print("1 2 ")
for x in range(3,n,2) :
if(p[x]==0) :
print(x)
ta,da, from the pixie goddess.
If I can get my Paxton's Wheel for Primes to work in C #programming language with some inline asselmbler , it should
be really fast. While memory wasting, its has no division, modulo division and minimal instruction cycles used per iteration. Coprimes are products of two or more #prime_numbers .
be really fast. While memory wasting, its has no division, modulo division and minimal instruction cycles used per iteration. Coprimes are products of two or more #prime_numbers .
November 14, 2025 at 10:47 AM
If I can get my Paxton's Wheel for Primes to work in C #programming language with some inline asselmbler , it should
be really fast. While memory wasting, its has no division, modulo division and minimal instruction cycles used per iteration. Coprimes are products of two or more #prime_numbers .
be really fast. While memory wasting, its has no division, modulo division and minimal instruction cycles used per iteration. Coprimes are products of two or more #prime_numbers .
#prime_numbers #programming Paxton's Wheel for Primes.
n=1000
p=[0]*n
p[4]=1
while():
for x in range(3,n,2):
if(p[x+1]==0) & (x*3<=n):
for y in range(x*3,n,x):
p[y+1]=1
print("1 2")
for x in range(3,n,2):
if(p[x+1]==0):print(x)
Why can't I get this to work?
n=1000
p=[0]*n
p[4]=1
while():
for x in range(3,n,2):
if(p[x+1]==0) & (x*3<=n):
for y in range(x*3,n,x):
p[y+1]=1
print("1 2")
for x in range(3,n,2):
if(p[x+1]==0):print(x)
Why can't I get this to work?
November 14, 2025 at 10:39 AM
#prime_numbers #programming Paxton's Wheel for Primes.
n=1000
p=[0]*n
p[4]=1
while():
for x in range(3,n,2):
if(p[x+1]==0) & (x*3<=n):
for y in range(x*3,n,x):
p[y+1]=1
print("1 2")
for x in range(3,n,2):
if(p[x+1]==0):print(x)
Why can't I get this to work?
n=1000
p=[0]*n
p[4]=1
while():
for x in range(3,n,2):
if(p[x+1]==0) & (x*3<=n):
for y in range(x*3,n,x):
p[y+1]=1
print("1 2")
for x in range(3,n,2):
if(p[x+1]==0):print(x)
Why can't I get this to work?
Sudden serenity...step out of life and enjoy a favorite album.
September 22, 2025 at 6:02 PM
Sudden serenity...step out of life and enjoy a favorite album.
There's nothing more boring than a man of habit.
September 21, 2025 at 3:43 PM
There's nothing more boring than a man of habit.
#movies #netflix #actionmovie #cybernetics : Coming soon to NetFlix , Jan.
17, 2027:
Fem-Bot
Programmed to love, programmed to kill.
Her last target was her first love. Does the heart win out?
Niki Paxton attached to direct , produce , write, star and clean up after the caste party.
17, 2027:
Fem-Bot
Programmed to love, programmed to kill.
Her last target was her first love. Does the heart win out?
Niki Paxton attached to direct , produce , write, star and clean up after the caste party.
September 21, 2025 at 12:34 AM
#movies #netflix #actionmovie #cybernetics : Coming soon to NetFlix , Jan.
17, 2027:
Fem-Bot
Programmed to love, programmed to kill.
Her last target was her first love. Does the heart win out?
Niki Paxton attached to direct , produce , write, star and clean up after the caste party.
17, 2027:
Fem-Bot
Programmed to love, programmed to kill.
Her last target was her first love. Does the heart win out?
Niki Paxton attached to direct , produce , write, star and clean up after the caste party.
September 21, 2025 at 12:24 AM
All
All I see, I know,
All I hear, I know,
All I read, I know,
All this is knowledge to me.
All I see, I know,
All I hear, I know,
All I read, I know,
All this is knowledge to me.
September 21, 2025 at 12:16 AM
All
All I see, I know,
All I hear, I know,
All I read, I know,
All this is knowledge to me.
All I see, I know,
All I hear, I know,
All I read, I know,
All this is knowledge to me.
Only two followers?!?! This is going to be one small cult. (hee,hee)
September 21, 2025 at 12:14 AM
Only two followers?!?! This is going to be one small cult. (hee,hee)
Life's too short for procrastination.
September 21, 2025 at 12:10 AM
Life's too short for procrastination.
Haikus and Life are whispers in hurracaine passing through time in a instant.
September 20, 2025 at 11:32 PM
Haikus and Life are whispers in hurracaine passing through time in a instant.
Hey fellow #physics freaks, I could use some info. I got a theory on #quantumentanglement in the area of #quantummechanics. Is there an open forum where I can publish a white paper? For your assistance I give you a lame physics joke: How do you haggle with a quantum mechanic? Discretely. (groan)
September 20, 2025 at 2:18 PM
Hey fellow #physics freaks, I could use some info. I got a theory on #quantumentanglement in the area of #quantummechanics. Is there an open forum where I can publish a white paper? For your assistance I give you a lame physics joke: How do you haggle with a quantum mechanic? Discretely. (groan)
My dream is to be a super villainess in a #jamesbond film and deliver the line: "I would never kill a man, for dead men don't suffer."
September 15, 2025 at 8:24 PM
My dream is to be a super villainess in a #jamesbond film and deliver the line: "I would never kill a man, for dead men don't suffer."
I am a daughter of God,
I am a fallen angel,
I am a redeemed saint,
I am a white demon,
I sing a thousand voices of a million souls,
I know everyone's pain,
I am all that is love,
I am a universe of facets on a prized diamond reflecting all,
I know no Alpha or Omega,
I only know truth.
I am a fallen angel,
I am a redeemed saint,
I am a white demon,
I sing a thousand voices of a million souls,
I know everyone's pain,
I am all that is love,
I am a universe of facets on a prized diamond reflecting all,
I know no Alpha or Omega,
I only know truth.
September 15, 2025 at 7:52 PM
I am a daughter of God,
I am a fallen angel,
I am a redeemed saint,
I am a white demon,
I sing a thousand voices of a million souls,
I know everyone's pain,
I am all that is love,
I am a universe of facets on a prized diamond reflecting all,
I know no Alpha or Omega,
I only know truth.
I am a fallen angel,
I am a redeemed saint,
I am a white demon,
I sing a thousand voices of a million souls,
I know everyone's pain,
I am all that is love,
I am a universe of facets on a prized diamond reflecting all,
I know no Alpha or Omega,
I only know truth.