Related papers: Complete solving the quadratic equation mod $2^n$

We prove that any function with real-valued coefficients, whose input is 4 binary variables and whose output is a real number, is perfectly equivalent to a quadratic function whose input is 5 binary variables and is minimized over the new…

The Welch map $x \rightarrow g^{x-1+c}$ is similar to the discrete exponential map $x \rightarrow g^x$, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to…

Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d. For \rho=1 or -1, we determine $\prod_{0<c<d, (d/c)=\rho} binomial coeff.{p-1}{\lfloor pc/d\rfloor}$ modulo p^2 in terms of Lucas numbers, the…

In this paper, we study additively indecomposable quadratic forms over real biquadratic and simplest cubic fields. In particular, we show that over these fields, we can always find such a classical form in 2 variables, which differs from…

We construct a two-parameter family of explicit solutions to the cubic wave equation on $\mathbb{R}^{1+3}$. Depending on the value of the parameters, these solutions either scatter to linear, blow-up in finite time, or exhibit a new type of…

New Strichartz estimates for the modulated cubic nonlinear Schr\"{o}dinger equation are proved. These Strichartz estimates allow us to show that this equation is pathwise locally well-posed. We also show that improved Strichartz estimates…

We discuss the equation $a^p + 2^\a b^p + c^p =0$ in which $a$, $b$, and $c$ are non-zero relatively prime integers, $p$ is an odd prime number, and $\a$ is a positive integer. The technique used to prove Fermat's Last Theorem shows that…

In this paper we establish some results about the existence and precise forms of finite order entire solutions of some systems of quadratic trinomial functional equations one of which in $\mathbb{C}^n$, $n\in\mathbb{N}$ and other two in…

We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.

Given a quadratic module, we construct its universal C*-algebra, and then use methods and notions from the theory of C*-algebras to study the quadratic module. We define residually finite-dimensional quadratic modules, and characterize them…

Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…

Let $p$ be an odd prime and let $d\in\{2,3,7\}$. When $(\frac{-d}p)=1$ we can write $p=x^2+dy^2$ with $x,y\in\mathbb Z$; in this paper we aim at determining $x$ or $y$ modulo $p^2$. For example, when $p=x^2+3y^2$, we show that if $p\equiv…

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

The \textit{Collatz's conjecture} is an unsolved problem in mathematics. It is named after Lothar Collatz in 1973. The conjecture also known as Syrucuse conjecture or problem. Take any positive integer $ n $. If $ n $ is even then divide it…

The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.

We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…

This paper presents a simplified method of expressing the solution to cubic equations in terms of function evaluation only. The method eliminates the need to manipulate the original coefficients of the cubic polynomial and makes the…

Recently, several mathematicians have investigated various partition functions with the goal of discovering Ramanujan-type congruences. One such function is $\overline{B}_{2^\alpha}(n)$, which represents the number of $2^\alpha-$regular…

This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.

Using the notion of the composita, we obtain a method of solving iterative functional equations of the form $A^{2^n}(x)=F(x)$, where $F(x)=\sum_{n>0} f(n)x^n$, $f(1)\neq 0$. We prove that if $F(x)=\sum_{n>0} f(n)x^n$ has integer…