Skip to main content
added 9 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76

Let $\sum_{i=1}^k a_ix_i = N$ be the equation with $a_i \in [2^t,2^{t+1}]$ being distinct primes. If we seek unique solutions $x_i\in R_i = (0,a_i)\cap \Bbb Z$, then in general it is not possible.

However, is it possible to divide each interval $R_i$ into $f(k,t)$ non-overlapping intervals for some polynomial $f$ such that the total number of integer points in $S_i$, the $\underline{\mbox{union of a subset}}$ of the non-overlapping intervals, satisfies $|S_i|>{2^{t-\delta(t,k)}}$ for some function $\delta(t,k)$ whose range on positive $t,k$ is bounded below by $0$ such that if we seek solutionsthere is a solution to $\sum_{i=1}^k a_ix_i = N$ with $x_i\in S_i$ then the solution is unique? What is the function $\delta(t,k)$ and how to find the solution $x_i\in S_i$?

Let $\sum_{i=1}^k a_ix_i = N$ be the equation with $a_i \in [2^t,2^{t+1}]$ being distinct primes. If we seek unique solutions $x_i\in R_i = (0,a_i)\cap \Bbb Z$, then in general it is not possible.

However, is it possible to divide each interval $R_i$ into $f(k,t)$ non-overlapping intervals for some polynomial $f$ such that the total number of integer points in $S_i$, the $\underline{\mbox{union of a subset}}$ of the non-overlapping intervals, satisfies $|S_i|>{2^{t-\delta(t,k)}}$ for some function $\delta(t,k)$ whose range on positive $t,k$ is bounded below by $0$ such that if we seek solutions $\sum_{i=1}^k a_ix_i = N$ with $x_i\in S_i$ then solution is unique? What is the function $\delta(t,k)$ and how to find the solution $x_i\in S_i$?

Let $\sum_{i=1}^k a_ix_i = N$ be the equation with $a_i \in [2^t,2^{t+1}]$ being distinct primes. If we seek unique solutions $x_i\in R_i = (0,a_i)\cap \Bbb Z$, then in general it is not possible.

However, is it possible to divide each interval $R_i$ into $f(k,t)$ non-overlapping intervals for some polynomial $f$ such that the total number of integer points in $S_i$, the $\underline{\mbox{union of a subset}}$ of the non-overlapping intervals, satisfies $|S_i|>{2^{t-\delta(t,k)}}$ for some function $\delta(t,k)$ whose range on positive $t,k$ is bounded below by $0$ such that if there is a solution to $\sum_{i=1}^k a_ix_i = N$ with $x_i\in S_i$ then the solution is unique? What is the function $\delta(t,k)$ and how to find the solution $x_i\in S_i$?

added 127 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76

On unique solutions to linear diophantine equations

Let $\sum_{i=1}^k a_ix_i = N$ be the equation with $a_i \in [2^t,2^{t+1}]$ being distinct primes. Let region $R_i = (0,a_i)\cap \Bbb Z$. Then ifIf we seek solutions unique solutions $x_i\in R_i$$x_i\in R_i = (0,a_i)\cap \Bbb Z$, then in general it is not possible.

However, is it possible to divide each interval $R_i$ into $f(k,t)$ non-overlapping intervals for some polynomial $f$ such that the total number of integer points in $S_i$, the $\underline{\mbox{union of a subset}}$ of the non-overlapping intervals, satisfies $|S_i|>{2^{t-\delta(t,k)}}$ for some function $\delta(t,k)$ whose range on positive $t,k$ is bounded below by $0$ such that if we seek solutions $\sum_{i=1}^k a_ix_i = N$ with $x_i\in S_i$ then solution is unique? What is the function $\delta(t,k)$ and how to find the solution $x_i\in S_i$?

On linear diophantine equations

Let $\sum_{i=1}^k a_ix_i = N$ be the equation with $a_i \in [2^t,2^{t+1}]$ being distinct primes. Let region $R_i = (0,a_i)\cap \Bbb Z$. Then if we seek solutions unique $x_i\in R_i$, then in general it is not possible.

However, is it possible to divide each interval $R_i$ into $f(k,t)$ non-overlapping intervals for some polynomial $f$ such that the total number of integer points in $S_i$, the $\underline{\mbox{union of a subset}}$ of the non-overlapping intervals, satisfies $|S_i|>{2^{t-\delta(t,k)}}$ for some function $\delta(t,k)$ whose range on positive $t,k$ is bounded below by $0$ such that if we seek solutions $\sum_{i=1}^k a_ix_i = N$ with $x_i\in S_i$ then solution is unique? What is the function $\delta(t,k)$ and how to find the solution $x_i\in S_i$?

On unique solutions to linear diophantine equations

Let $\sum_{i=1}^k a_ix_i = N$ be the equation with $a_i \in [2^t,2^{t+1}]$ being distinct primes. If we seek unique solutions $x_i\in R_i = (0,a_i)\cap \Bbb Z$, then in general it is not possible.

However, is it possible to divide each interval $R_i$ into $f(k,t)$ non-overlapping intervals for some polynomial $f$ such that the total number of integer points in $S_i$, the $\underline{\mbox{union of a subset}}$ of the non-overlapping intervals, satisfies $|S_i|>{2^{t-\delta(t,k)}}$ for some function $\delta(t,k)$ whose range on positive $t,k$ is bounded below by $0$ such that if we seek solutions $\sum_{i=1}^k a_ix_i = N$ with $x_i\in S_i$ then solution is unique? What is the function $\delta(t,k)$ and how to find the solution $x_i\in S_i$?

added 127 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76

Let $\sum_{i=1}^k a_ix_i = N$ be the equation with $a_i \in [2^t,2^{t+1}]$ being distinct primes. Let region $R_i = (0,a)\cap \Bbb Z$$R_i = (0,a_i)\cap \Bbb Z$. Then if we seek solutions unique $x_i\in R_i$, then in general it is not possible.

However, is it possible to divide each interval $R_i$ into disjoint regions $S_i$ and$f(k,t)$ non-overlapping intervals for some polynomial $S_i^c$$f$ such that the total number of integer points in $S_i$, the $\underline{\mbox{union of a subset}}$ of the non-overlapping intervals, satisfies $|S_i|>{2^{t-\delta(t,k)}}$ for some function $\delta(t,k)$ whose range on positive $t,k$ is bounded below by $0$ such that if we seek solutions $\sum_{i=1}^k a_ix_i = N$ with $x_i\in S_i$ then solution is unique? What is the function $\delta(t,k)$ and how to find the solution $x_i\in S_i$?

Let $\sum_{i=1}^k a_ix_i = N$ be the equation with $a_i \in [2^t,2^{t+1}]$ being distinct primes. Let region $R_i = (0,a)\cap \Bbb Z$. Then if we seek solutions unique $x_i\in R_i$, then in general it is not possible.

However, is it possible to divide each interval $R_i$ into disjoint regions $S_i$ and $S_i^c$ such that the number of integer points in $S_i$ satisfies $|S_i|>{2^{t-\delta(t,k)}}$ for some function $\delta(t,k)$ whose range on positive $t,k$ is bounded below by $0$ such that if we seek solutions $\sum_{i=1}^k a_ix_i = N$ with $x_i\in S_i$ then solution is unique? What is the function $\delta(t,k)$ and how to find the solution $x_i\in S_i$?

Let $\sum_{i=1}^k a_ix_i = N$ be the equation with $a_i \in [2^t,2^{t+1}]$ being distinct primes. Let region $R_i = (0,a_i)\cap \Bbb Z$. Then if we seek solutions unique $x_i\in R_i$, then in general it is not possible.

However, is it possible to divide each interval $R_i$ into $f(k,t)$ non-overlapping intervals for some polynomial $f$ such that the total number of integer points in $S_i$, the $\underline{\mbox{union of a subset}}$ of the non-overlapping intervals, satisfies $|S_i|>{2^{t-\delta(t,k)}}$ for some function $\delta(t,k)$ whose range on positive $t,k$ is bounded below by $0$ such that if we seek solutions $\sum_{i=1}^k a_ix_i = N$ with $x_i\in S_i$ then solution is unique? What is the function $\delta(t,k)$ and how to find the solution $x_i\in S_i$?

added 52 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading
added 10 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76
Loading