Search Results

Let $n>1$ be odd integer. Define the Euler quotient $a(n)=\frac{2^{\varphi(n)}-1 \bmod n^2}{n}$. Number $n$ with $a(n)=0$ is Wieferich number and if it is prime it is Wieferich prime. It is open probl …

We got a probabilistic integer factorization algorithm and experimental evidence with large integers given bounds for one factor. Let $D \ge 2$ be real number and let $p,q$ be primes and $N=pq$. Assum …

The computer found this. Let $n$ be a positive integer. Up to $n=200$ we have: $$\frac{\varphi(2^n-1)}{n}=\frac{2^{\varphi(2^n-1)}-1 \bmod (2^n-1)^2}{2^n-1}. \tag{1}\label{483144_1}$$ Q1 Is \eqref{48 …

For odd natural $n$ define the Euler quotient: $$ a(n)=\frac{(2^{\phi(n)}-1) \bmod n^2}{n}=\frac{2^{\phi(n)}-1}{n} \bmod n$$ $a(n)=0$ is $n$ being Wieferich number (not necessarily prime). For odd $n$ …

Probably this is impossible, but let us try. Working over $\mathbb{Q}[x_1,...,x_n]$. Let $T_i$ be $n$ sets of rationals with cardinality $B$. Assume we are given $n-2$ linear equations $f_i$ which are …

Let $n$ be positive integer, $k$,$B$ fixed positive integers. Let $f_i(x_1,x_2...x_n)$ be a system of $n-k$ linearly independent linear equations over the integers. Let $S(f_i,k,B)$ be the set of solu …

For odd integer $n$ define the function $$ J(n)=(2^{\varphi(n)}-1) \bmod{n^2}$$ $J(n)$ is integer in $[0,n^2-1]$ and it is divisible by $n$. Integer $n$ is Wieferich number iff $J(n)=0$ and if $n$ is …

Might be related to Wieferich primes. Let $p$ be odd prime and define the Fermat quotient $$F(n)=\frac{(2^{n-1} -1)}{n} \mod n=\frac{(2^{n-1} \bmod n^2 )-1}{n}$$ For integer $b$ let $L_p(b)$ be the $p …

Related to normal numbers. Let $n\#$ denote the primorial, the product of the first $n$ primes. Q1 For all bases $b>1$, do the base $b$ digits of $n\#$ occur with equal asymptotic frequency $\frac1b$ …

For non-zero complex $A$, define the curve over the complex numbers $C: x^2 y^2-A x-y=0$. $C$ is an elliptic curve. $C$ has the differential equation parametrization $(x,y)=(f(x),f'(x))$ where $$ f(x) …

I wasted some electricity on a very similar problem until I realized that if we fix all variables except one, then the abc theorem for polynomials may imply non-existence after parametrization of all …

Let $a(n)$ be a sequence of rational numbers with generating function $F(x)$. Assume $F(x)$ is composition of rational functions and radicals (roots). Is the following conjecture true: Conjecture 1: …

A special case of this question and another question What is the complexity of solving system of binary quadratic equations modulo $3$? $f_i(x_i,x_j)=0 \bmod 3, \deg{f_i}=2$. Modulo $2$ can be formu …

Here is some experimental data. For positive integer $k$ let $E_k: y^2=x^3+k x $ and $k_1=2,k_2=3$. According to computations with sage, for $0 < k < 2000$: At least one of $\displaystyle r_{\text{a …

In an answer here Dima Pasechnik showed that constraints of the form $x_i x_j + a_{ij}x_i + b_{ij}x_j + c_{ij}$ are efficiently solvable modulo $2$ using Groebner basis. In comments he suggested that …