Counting function for powers of primes

robnybod
Messages
3
Reaction score
0
removed
 
Last edited:
Physics news on Phys.org
at this point it is more important for you to show that your method works. I suggest you write a program and test your method using the formulas you posted. If the test works for large numbers, then you have something serious. By the way, this problem is an open problem in number theory so you may just have come up with a solution.
 
"Method" is correct and works, in the sense that it will give correct numbers in general. Unfortunately you will not be able to condense your expressions significantly. You would then, among other things, likely need a formula for the nth prime, and btw the exact same set up of inclusion/exclusion and floors can be used to express the prime counting function, for which there is very likely no short and elementary formula.
 
Sorry to see you remove this. Was Interesting.
 

Thread '##(A/\mathfrak{a})_{\mathfrak{p}/\mathfrak{a}}## and its isomorphism?'

I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I Irreducible polynomials and prime elements
Replies
5
Views
2K
I Localising a non integral domain at a prime
Replies
17
Views
1K
I Localizing single variable quotient polynomial ring at a prime ideal
Replies
6
Views
689
Questions about the prime counting function
Replies
1
Views
3K
MHB Proving Zp is a Vector Space for Prime p
Replies
4
Views
2K
I Frequency of prime number gaps according to (p-1)/(p-2)
Replies
2
Views
1K
MHB 412.00.1.12 are relatively prime for all n.
Replies
1
Views
1K
Longest repeated sequence in the prime counting function
Replies
3
Views
3K
Counting with composites Please advise
Replies
33
Views
7K
MHB Prove R is a Sub-ring of $\mathbb{Q}$ - Prime $p \in \mathbb{Z}$
Replies
11
Views
2K

Hot Threads

Recent Insights

Back
Top