Related papers: SPM Bulletin 10
Automatically generating high-quality step-by-step solutions to math word problems has many applications in education. Recently, combining large language models (LLMs) with external tools to perform complex reasoning and calculation has…
This is an update of my problem list.
We discuss a (10+2)D N=(1,1) superalgebra and its projections to M-theory, type IIA and IIB algebras. From the complete classification of a second-rank central term valued in the so(10,2) algebra, we find all possible BPS states coming from…
A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof of the more…
The decimal expansion of 1/7 is 0.142857142857..., the block 142857 repeating forever. We call 142857 the period and its length is 6 = 2x3. If the period is broken into 2 pieces each of length 3 which are then added, the result is 142 + 857…
In a 2011 paper published in the journal "Asian Journal of Algebra"(see reference[1]), the authors consider, among other equations,the diophantine equations 2xy=n(x+y) and 3xy=n(x+y). For the first equation, with n being an odd positive…
For every non-integral $\alpha>1$, the sequence of the integer parts of $n^{\alpha}$ $(n=1,2,\ldots)$ is called the Piatetski-Shapiro sequence with exponent $\alpha$, and let $\mathrm{PS}(\alpha)$ denote the set of all those terms. For all…
We extend several known results on solvability in the Sobolev spaces $W^{1}_{p}$, $p\in[2,\infty)$, of SPDEs in divergence form in $\bR^{d}_{+}$ to equations having coefficients which are discontinuous in the space variable.
Let $p\equiv 1 \pmod{4}$ be a prime. Write $t = \prod_{x=1}^{(p-1)/2}x$. Since $t ^2\equiv -1 \pmod{p}$ , we can divide $\{1,2,\ldots,(p-1)/2\}$ into $(p-1)/4$ ordered pairs so that each pair, say $<a,\tilde{a}>$ , satisfies that $t a…
We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…
This document is a brief summary of progress that has been made on the problems posed in the document "Twenty Open Problems in Enumeration of Matchings" (also available from this server as math.CO/9801060). NOTE: This article has now been…
This issue surveys some of the activities in the field since the previous issue, and announces a conference fully dedicated to the topic of selection principles.
Decays of unstable heavy particles usually involve the coherent sum of several amplitudes, like in a multiple slit experiment. Dedicated amplitude analysis techniques have been widely used to resolve these amplitudes for better…
We provide bounds on the compression size of the solutions to 22 problems in computer science. For each problem, we show that solutions exist with high probability, for some simple probability measure. Once this is proven, derandomization…
Satisfiability Modulo Counting (SMC) is a recently proposed general language to reason about problems integrating statistical and symbolic Artificial Intelligence. An SMC problem is an extended SAT problem in which the truth values of a few…
In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume $E_2$-values; i.e., values that are products of…
We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…
The problem of finding all the integer solutions in $a$, $M$ and $s$ of sums of $M$ consecutive integer squares starting at $a^{2}\geq1$ equal to squared integers $s^{2}$, has no solutions if $M\equiv3,5,6,7,8$ or $10\left(mod\,12\right)$…
In this paper, we gave solutions of the Diophantine equations 16^{x}+p^{y}=z^{2}, 64^{x}+p^{y}=z^{2} where p is an odd prime, n is a positive integer and x,y,z are non-negative integers. Finally we gave a generalization of the Diophantine…
We propose an elemantary approach to Zudilin's q-question about Schmidt's problem [Electron. J. Combin. 11 (2004), #R22], which has been solved in a previous paper [Acta Arith. 127 (2007), 17--31]. The new approach is based on a q-analogue…