I am trying to establish the one-to-one correspondence of twin primes to integers $n$ where $n^2-1$ has 4 divisors. It is clear to me that this is the case, since $$n^2-1=(n+1)(n-1)$$ where the RHS would represent the twin primes. I think I can set my bijection up using the function $$f(n-1,n+1)=(n-1)(n+1)$$ HOwever, I'm having difficulties starting this argument off. I need to show injectivity and surjectivity. Thus, $$f(n_1-1,n_1+1)=f(n_2-1,n_2+1)$$ $$(n_1-1)(n_1+1)=(n_2-1)(n_2+1)$$ $$n_1^2-1=n_2^2-1$$ $$n_1^2=n_2^2$$ $$\sqrt{n_1^2}=\sqrt{n_2^2}$$ $$n_1=n_2$$ I took a liberty here since I'm pretty sure since dealing with twin primes and primes in general the assumption would be we are working in the positive integer realm (or at least non-negative) Now for surjectivity, I take an integer from the set of numbers of the form $n^2-1$ Then $$n^2-1=(n-1)(n+1)=(6k-1)(6k+1)=f(6k-1,6k+1).$$ I chose $6k-1, 6k+1$ since a previous exercise had me show there twin primes come in the form. To finalize the surjection, I have to tie in the fact that there are twin primes (3,5) that do not fall in this form. So how do I complete my argument, if it is correct to begin with?
2026-04-08 19:39:39.1775677179
1-to-1 correspondence between twin primes and $n^2-1$
280 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ELEMENTARY-NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- How do I show that if $\boldsymbol{a_1 a_2 a_3\cdots a_n \mid k}$ then each variable divides $\boldsymbol k $?
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- Algebra Proof including relative primes.
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
- algebraic integers of $x^4 -10x^2 +1$
- What exactly is the definition of Carmichael numbers?
- Number of divisors 888,888.
Related Questions in FUNCTIONS
- Functions - confusion regarding properties, as per example in wiki
- Composition of functions - properties
- Finding Range from Domain
- Why is surjectivity defined using $\exists$ rather than $\exists !$
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Lower bound of bounded functions.
- Does there exist any relationship between non-constant $N$-Exhaustible function and differentiability?
- Given a function, prove that it's injective
- Surjective function proof
- How to find image of a function
Related Questions in PRIME-NUMBERS
- New prime number
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- How do I prove this question involving primes?
- What exactly is the definition of Carmichael numbers?
- I'm having a problem interpreting and starting this problem with primes.
- Decimal expansion of $\frac{1}{p}$: what is its period?
- Multiplying prime numbers
- Find the number of relatively prime numbers from $10$ to $100$
- A congruence with the Euler's totient function and sum of divisors function
- Squares of two coprime numbers
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
$\begin{align}\text{Let}\ T & = \{ (p, q) \mid p, q \in \mathbb{P},\ q - p = 2 \}\\ V & = \{n^2 - 1 \mid n \in \mathbb{N},\ \text{d}(n^2-1) = 4\} \end{align}$
Theorem [Eleven-Eleven]
$T \cong V$
Proof
Let $f:T \to V$, $(p, q) \mapsto pq$.
$f(p_1, q_1) = f(p_2, q_2) \Rightarrow\\ p_1q_1 = p_2q_2 \Rightarrow\\ p_1 = p_2,\ q_1 = q_2\ [\text{unique prime factorization of $p_1q_1 = p_2q_2$, with $p_1 < q_1$, $p_2 < q_2$}]$
$\therefore$ $f$ is an injection.
Let $n^2 - 1 \in V$.
$1$, $n - 1$, $n + 1$, $n^2 - 1$ are distinct factors of $n^2 - 1$, and $d(n^2 - 1) = 4$ $\Rightarrow$
$(n - 1), (n + 1) \in \mathbb{P} \Rightarrow$
$(n - 1, n + 1) \in T,\ f(n - 1, n + 1) = n^2 - 1$
$\therefore$ $f$ is a surjection.
1, 2 $\Rightarrow$ $f$ is a bijection.
$\therefore T \cong V$