Share Your Experience: Take the 2024 Developer Survey

# Tag Info

• 81

### Primes with prime bit-counts

PARI/GP, 64 bytes n->p=isprime;[i|i<-[1..n],p(i)*p(t=vecsum(b=binary(i)))*p(#b-t)] Attempt This Online!
• 48.2k

### Primes with prime bit-counts

PARI/GP, 140 bytes 140 bytes, it can be golfed more. Golfed version. Attempt This Online! ...
• 5,951
1 vote

### Primes with prime bit-counts

Pyt, 17 bytes řĐṗ*žĐĐĦṗ⇹˜⁻Ħṗ**ž Try it online! ...
• 1,717
1 vote

### Piecing Paired Primes

Pyt, 7 bytes ⁺řᵽᵮʁ/Ʃ Try it online! ...
• 1,717

### Can even numbers become prime?

Pyt, 15 bytes 2⇹ŘĐĐ⁻Ḷ⁺Ɩᴇ*+⁻ṗƩ Try it online! ...
• 1,717
1 vote

### Is it a Mersenne Prime?

Pari/GP, 29 bytes A port of @lirtosiast's Mathematica answer in Pari/GP. Golfed version. Try it online! g(n)=isprime(bitand(n,n+2)*n)
• 5,951

### Is it a Mersenne Prime?

05AB1E, 5 bytes bWIp* Try it online! Explanation b: push binary version of (implicit) input ...
• 69

### Is it a Mersenne Prime?

Pyt, 8 bytes Đṗ⇹ɓąƖΠ* Try it online! ...
• 1,717

Top 50 recent answers are included