Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 89 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 98 tok/s Pro
GPT OSS 120B 424 tok/s Pro
Kimi K2 164 tok/s Pro
2000 character limit reached

Algebraic analogues of results of Alladi-Johnson using the Chebotarev Density Theorem (2410.22226v1)

Published 29 Oct 2024 in math.NT

Abstract: \textit{{\small We aim to get an algebraic generalization of Alladi-Johnson's (A-J) work on Duality between Prime Factors and the Prime Number Theorem for Arithmetic Progressions - II, using the Chebotarev Density Theorem (CDT). It has been proved by A-J, that for all positive integers $k,\ell$ such that $1\leq \ell\leq k$ and $(\ell,k)=1$,}} \begin{equation} \sum_{n\geq 2;\;p_1(n) \equiv \ell\;(mod\;k)}\frac{\mu(n)\omega(n)}{n} = 0, \nonumber \end{equation} \textit{{\small where $\mu(n)$ is the M\"obius function, $\omega(n)$ is the number of distinct prime factors of $n$, and $p_1(n)$ is the smallest prime factor of $n$. In our work here, we will prove the following result: If $C$ is a conjugacy class of the Galois group of some finite extension $K$ of $\mathbb{Q}$, then}} \begin{equation} \sum_{ n \geq 2;\;\left[\frac{K/\mathbb{Q}}{p_1(n)}\right]=C} \frac{\mu(n)\omega(n)}{n} = 0. \nonumber \end{equation} \textit{{\small where $\left[\frac{K/\mathbb{Q}}{p_1(n)}\right]$ is the Artin symbol. When $K$ is a cyclotomic extension of $\mathbb{Q}$, this reduces to the exact case of A-J's result.}}

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)