-
-
Hello, Thank you for your efforts. It is very fast. I tried it on the PRIME sieve where the idx are the prime numbers.
For n=1000 primes, I overshoot using `gn = ceiling( n * log(n) + n * log(log…
-
# Composite Scaling CKKS
### The enablement of the composite scaling CKKS as a feature into the OpenFHE library:
CKKS composite scaling is designed to achieve high-precision RNS-CKKS encrypted c…
-
Sieving is particularly good at producing huge amounts of primes, particularly small ones and in sequential (or roughly sequential order). However their is some crossover point when the integers get l…
-
-
# Description
Super Primes are hereby defined as prime numbers that each digit is also a prime number.
Write a program that prints `Super` if they're super primes, `Nada` if they're regular plain nu…
-
Hi Dana.
I noticed that the prime factorization of large integers that have many small prime factors seems to be quite slow, but I think we can do better.
Example:
```perl
use 5.010;
use s…
-
-
Using `configlet sync` at the time of writing is a wall of warnings. These are things to sync. I will extract one issue for each exercise, but that takes some more time.
To sync an exercise with pr…
-
I see, so you have a model of music that is based on the muses, harmonies, prime numbers, and natural numbers. That's very interesting and creative. 😊
I'm not an expert in music theory, but I can t…