top of page

danielleloranevents Group

Public·27 members
Andrew Panfilov
Andrew Panfilov

Hopf, Michael G Rar



Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^n-k+1 \equiv a \pmodn$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient condition for the infinitude of $C_k$. Moreover, we prove that there are finitely many elements in $C_k$ with one and two prime factors if and only if $k>0$ and $k$ is prime. In addition, if all but two prime factors of $n \in C_k$ are fixed, then there are finitely many elements in $C_k$, excluding certain infinite families of $n$. We also give conjectures about the growth rate of $C_k$ with numerical evidence. We explore a similar question when both $a$ and $k$ are fixed and prove that for fixed integers $a \geq 2$ and $k$, there are infinitely many integers $n$ such that $a^n-k \equiv 1 \pmodn$ if and only if $(k,a) \neq (0,2)$ by building off the work of Kiss and Phong. Finally, we discuss the multiplicative properties of positive integers $n$ such that Carmichael function $\lambda(n)$ divides $n-k$.




Hopf, Michael G rar


Download File: https://www.google.com/url?q=https%3A%2F%2Fvittuv.com%2F2uepyU&sa=D&sntz=1&usg=AOvVaw3VjPybMyalvKE2HSxaMZe5



In this paper, we study the properties of Carmichael numbers, false positives to several primality tests. We provide a classification for Carmichael numbers with a proportion of Fermat witnesses of less than 50%, based on if the smallest prime factor is greater than a determined lower bound. In addition, we conduct a Monte Carlo simulation as part of a probabilistic algorithm to detect if a given composite number is Carmichael. We modify this highly accurate algorithm with a deterministic primality test to create a novel, more efficient algorithm that differentiates between Carmichael numbers and prime numbers. 041b061a72


About

Welcome to the group! You can connect with other members, ge...

Members

bottom of page