Related papers: Frobenius Pseudoprimes
We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.
One of the greatest difficulties encountered by all in their first proof intensive class is subtly assuming an unproven fact in a proof. The purpose of this note is to describe a specific instance where this can occur, namely in results…
Over the past decades, alongside advancements in natural language processing, significant attention has been paid to training models to automatically extract, understand, test, and generate hypotheses in open and scientific domains.…
The notion off-ideals is recent and has been studied in the papers[1] [2], [5], [10], [11], [12], [13], [14] and [15]. In this paper, we have generalized the idea off-ideals to quasi f-ideals. This extended class of ideals is much bigger…
Ratios of universal enumerable semimeasures corresponding to hypotheses are investigated as a solution for statistical composite hypotheses testing if an unbounded amount of computation time can be assumed. Influence testing for discrete…
Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…
We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…
In the last months, due to the emergency of Covid-19, questions related to the fact of belonging or not to a particular class of individuals (`infected or not infected'), after being tagged as `positive' or `negative' by a test, have never…
In 1876, Edouard Lucas showed that if an integer $b$ exists such that $b^{n-1} \equiv 1 (\mathrm{mod} \ n)$ and $b^{(n-1)/p} \not\equiv 1( \mathrm{mod} \ n)$ for all prime divisors $p$ of $n-1$ , then $n$ is prime, a result known as Lucas's…
In this paper we obtain lower and upper bounds on the average number of liars for the Quadratic Frobenius Pseudoprime Test of Grantham, generalizing arguments of Erd\H{o}s and Pomerance, and Monier. These bounds are provided for both Jacobi…
We study the Frobenius problem for certain k-tuplets, which include prime k-tuplets, in particular prime triplets and prime quadruplets. Moreover, we analyze some properties of the numerical semigroups associated with these tuplets.
Generalized pseudostandard words have been introduced by de Luca and De Luca in 2006. In comparison to the palindromic and pseudopalindromic closure, only little is known about the generalized pseudopalindromic closure and the associated…
This paper is based on lectures presented to mathematical physicists and attempts to provide an overview of the present status of the Standard Model, its experimental tests, phenomenological and experimental motivations for going beyond the…
In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture…
We present new counterexamples, which provide stronger limitations to sums-differences statements than were previously known. The main idea is to consider non-uniform probability measures.
We experiment with some topics in elementary number theory. For matrices defined by Gaussian primes we observe a circular spectral law for the eigenvalues. We look at matrices defined by Gaussian primes and look at the growth of the…
The most popular hypothesis testing procedure, the likelihood ratio test, is known to be highly non-robust in many real situations. Basu et al. (2013a) provided an alternative robust procedure of hypothesis testing based on the density…
Representations of primes by simple quadratic forms, such as $\pm a^2\pm qb^2$, is a subject that goes back to Fermat, Lagrange, Legendre, Euler, Gauss and many others. We are interested in a comprehensive list of such results, for $q\le…
In the first section of the present work, we introduce the concept of pseudocomplementation for semirings and show semiring version of some known results in lattice theory. We also introduce semirings with pc-functions and prove some…
When permutation methods are used in practice, often a limited number of random permutations are used to decrease the computational burden. However, most theoretical literature assumes that the whole permutation group is used, and methods…