Division theoryand Prime Number theory

Moses
Messages
68
Reaction score
0
Hey,
A while ago i hear about finding the division number theory [Tell how a number can be divied be another unmber as a general formula]. And i am wondering if there is a theory "desicovered" the pattern of the prime numbers. Or at least a fixed pattern for predicting some of the prime numbers "i.e. skipping some".
 
Last edited:
Physics news on Phys.org
actually i was thinking that number like pi and e have clearly obious patterns in binary. perhaps there's a pattern to primes in some base too...?
 
T@P said:
actually i was thinking that number like pi and e have clearly obious patterns in binary.

Really ?
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
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 Confused about Gauss's Lemma of Irreducibility
Replies
4
Views
2K
I Frequency of prime number gaps according to (p-1)/(p-2)
Replies
2
Views
1K
I Questions about non existence of GCDs vs (coimages, cokernels)
Replies
12
Views
128
B Probability that 2 distinct integers are divisible by the same number
Replies
9
Views
2K
Discussion on Astronomical Prime Numbers and Re-evaluating the Primali
Replies
5
Views
1K
A Is it required to use the Reimann function to solve the problem?
Replies
8
Views
1K
Our Old Friend, the Twin Primes Conjecture
Replies
11
Views
2K
I Can This Formula Identify All Prime Numbers?
Replies
2
Views
1K
Found Some Pattern in prime numbers
Replies
21
Views
9K
Existence of a function for the n-th prime
Replies
6
Views
4K

Hot Threads

Recent Insights

Back
Top