A How should I write an account of prime numbers?

Math100
Messages
813
Reaction score
229
How should I write an account of prime numbers in arithmetic progressions? Assuming this account should be in the form of an essay of at least ## 500 ## words. Should I apply the formula ## a_{n}=3+4n ## for ## 0\leq n\leq 2 ##? Can anyone please provide any idea(s)?
 
Mathematics news on Phys.org
The first sentence of Wiki you quoted says:In number theory, primes in arithmetic progression are any sequence of at least three prime numbers that are consecutive terms in an arithmetic progression. Doesn't it work for your purpose ?
 
Can you provide more details. What is an account? Normally we think bank account or something similar.

Do you mean an essay?
 
anuttarasammyak said:
The first sentence of Wiki you quoted says:In number theory, primes in arithmetic progression are any sequence of at least three prime numbers that are consecutive terms in an arithmetic progression. Doesn't it work for your purpose ?
I am not completely sure of whether or not this will work for my purpose.
 
jedishrfu said:
Can you provide more details. What is an account? Normally we think bank account or something similar.

Do you mean an essay?
I wish there are more details in this question, but no. The question states: "Write an account of prime numbers in arithmetic progressions. Your account should be in the form of an essay of 500-1000 words."
 
Read the Wikipedia article, then regurgitate the information in different words. This sounds like a silly project.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top