Forum: Charles Kusniec
2023-03-02, 22:32
|
Replies: 21
Views: 3,468
|
Forum: Charles Kusniec
2023-03-02, 01:45
|
Replies: 21
Views: 3,468
What a wonderful surprise to google and find my...
What a wonderful surprise to google and find my work on OEISWiki still online! I promised Neil Sloane that I would not write anything on OEISWiki... But, I started to get inspired by this wonderful...
|
Forum: Charles Kusniec
2023-02-28, 01:18
|
Replies: 21
Views: 3,468
Some corrections and improvements
...That's exactly because prime 2 is the first non-negative even number that is prime, and it is not a multiple of any previous prime.
...That's exactly because prime 3 is the first non-negative...
|
Forum: Charles Kusniec
2023-02-27, 14:27
|
Replies: 21
Views: 3,468
Is the number 2 really the oddest prime number?
Is the number 2 really the oddest prime number?
In general, people say "prime 2 is the oddest prime number" because "prime 2 is the only even prime number".
Could it be that when we state this...
|
Forum: Charles Kusniec
2022-12-15, 11:21
|
Replies: 21
Views: 3,468
A354882
Yesterday I noticed that Florian Baur has edited the https://oeis.org/A354882 sequence with interesting new comments.
|
Forum: Charles Kusniec
2021-12-22, 13:00
|
Replies: 21
Views: 3,468
The integer numbers in the form of CCCC.
The integers a(n) in the form of CCCC are those that produce 4 composites in the form of [$](a(n)+-(d_s+1))[/$] and [$](a(n)+-1)[/$].
They form the sequence AAAAAA The primes a(n) that produce...
|
Forum: Charles Kusniec
2021-12-12, 23:02
|
Replies: 21
Views: 3,468
I noticed now: there is an error in the 2...
I noticed now: there is an error in the 2 definitions. The correct is:
Let us call [$]d_s[/$] the number of divisors in the first sequence of consecutive divisors of an integer number. Its values...
|
Forum: Charles Kusniec
2021-12-12, 14:35
|
Replies: 21
Views: 3,468
Important features and new sequences
We can express uniquely all integers as the product of their two complementary central divisors. We call these two divisors as the central pair of complementary divisors. These two central divisors...
|
Forum: Charles Kusniec
2021-12-08, 13:40
|
Replies: 21
Views: 3,468
Similar to Brun theorem at...
Similar to Brun theorem at https://en.wikipedia.org/wiki/Brun%27s_theorem, we can calculate various constants for all possible duets, trios and quartets of primes in the form of "soviets". Would...
|
Forum: Charles Kusniec
2021-12-06, 22:30
|
Replies: 21
Views: 3,468
|
Forum: Charles Kusniec
2021-12-05, 21:04
|
Replies: 21
Views: 3,468
|
Forum: Charles Kusniec
2021-12-02, 15:50
|
Replies: 21
Views: 3,468
New name ideia.
I think it's important to properly name these sets of prime numbers. It helps when we make comparisons and detect some properties of prime numbers.
So, without wanting to be repetitive or abusive,...
|
Forum: Charles Kusniec
2021-12-01, 22:22
|
Replies: 21
Views: 3,468
Names for the primes sets. (continuation)
Regarding the names I missed for your evaluation:
6. Let's call "duet primes" a set of two primes in the form of (composite±(d_s [composite]+1)). In this case, (composite±1) are not primes.
Please...
|
Forum: Charles Kusniec
2021-12-01, 18:32
|
Replies: 21
Views: 3,468
Names for the primes sets.
Regarding the names I would like to propose for your evaluation:
1. Let's call "quartet primes" a set of four primes in the form of (composite±(d_s [composite]+1)) and (composite±1).
2. Let us call...
|
Forum: Charles Kusniec
2021-11-27, 15:11
|
Replies: 21
Views: 3,468
Dear Bur, thank you very much for your comments...
Dear Bur, thank you very much for your comments and suggestions.
I would not expect continuous behavior for all d_s. The reason is that all divisors d_s will always be less than sqrt(n). This means...
|
Forum: Charles Kusniec
2021-11-23, 11:46
|
Replies: 21
Views: 3,468
|
Forum: Charles Kusniec
2021-11-23, 11:27
|
Replies: 21
Views: 3,468
|
Forum: Charles Kusniec
2021-11-23, 03:38
|
Replies: 21
Views: 3,468
|
Forum: Charles Kusniec
2021-11-16, 16:49
|
Replies: 21
Views: 3,468
An idea for a new class of some numbers.
Let us define d_s [composite] is the number of divisors in the first sequence of consecutive divisors of a composite number. Consequently, it is only possible to have the closest prime numbers in the...
|