Submitted:
14 September 2025
Posted:
15 September 2025
You are already at the latest version
Abstract
Keywords:
1. Introduction
2. Why Mathematicians Resist AI
2.1. Epistemological Concerns
2.2. Sociological and Community Norms
2.3. Pedagogical and Educational Risks
2.4. Case Study: The Impact of Context on AI Responses
2.4.1. Case A: Query Without Context (Non-Mathematician)
“Is there an elegant positive recursive formula for ?”
2.4.2. Case B: Expert-Guided Query (Mathematician)
“I am working with the expression . This can be written in terms of harmonic numbers as . Since the harmonic numbers satisfy a simple recursion , I am looking for a comparable recursion for . Ideally, should be expressed in terms of plus new positive contributions. Is there such a formula, and what is the asymptotic behavior of as ?”
2.4.3. Discussion
3. Case Study: Narrow AI Replies vs. Expert-Guided Answers
3.1. Case A: A Narrow (and Potentially Wrong) AI-Style Response
Mock AI Reply (Non-Expert Prompt)
“There is no simple recursive formula for . Asymptotically , so the sequence grows like the natural logarithm. Therefore no simple additive recursion exists — the best one can say is .”
Why This Reply Is Misleading or Wrong
- Over-simplification of asymptotics. Claiming as if it were an exact identity is false; in fact converges to zero slowly and the explicit first-order correction is of order with a specific coefficient (see Case B). Presenting only “” without the next-order term misrepresents the true behaviour and removes information essential for rigorous work.
- Vague recurrence statement. Saying “no simple additive recursion exists” without demonstrating the structural obstruction (the dropped index k when passing to ) is unhelpful. A precise exact recurrence does exist (it involves a negative term and a new block-sum); the AI’s claim is therefore incomplete.
- Lack of checks or references. The mock reply gives no identities, no harmonic-number representation, no numerical checks, and no references (e.g., the harmonic-number identity ). Non-expert users may accept such a terse answer and thereby be misled.
3.2. Case B: The Expert-Guided Answer (as Provided by an Expert / AI with Mathematical Context)
The exact recursive formula for is the following interesting harmonic discrete dynamical system:
There is no simpler closed-form recursive relationship because the summation term involves terms that do not simplify to an elementary expression. This is due to the quadratic growth of the upper limit in the definition of . For practical computation, this recurrence can be used, but it requires summing terms per step, at least or obtaining strong bounds.
Upper Bounds on the Growth of
Recall that the sequence is defined by
Using harmonic numbers, we have the exact identity
where is the n-th harmonic number. From the Euler–Maclaurin expansion,
we obtain
Simplifying gives, for large k,
Expanding the logarithm,
which shows that the growth of is essentially logarithmic.
Using sharp bounds for harmonic numbers,
we deduce the following explicit upper bound:
which is extremely tight for all . For a simpler but looser bound, we also have
Minor Technical Clarification
3.2.0.5. Numerical/Graphical Confirmation
3.3. Summary of the Two Cases
- Case A (non-expert prompt): produces short, imprecise, and possibly incorrect answers (e.g. asserting or making vague negative claims) because the AI lacks context and the user lacks expertise to demand derivations and checks.
- Case B (expert-guided prompt): yields an exact, verifiable recurrence and an accurate asymptotic expansion; the AI output—when steered by an expert to produce derivations, references, and numerical checks—turns into a useful research assistant.
4. The Perils of AI Detection in Academic Research
5. Towards Responsible Integration of AI in Mathematics
5.1. Expert-Guided AI Use in Research
- Always request derivations and explicit reasoning steps when using LLMs for mathematical tasks; follow up with independent numerical checks or symbolic verification (e.g., using a CAS or a formal proof assistant).
- Require that any claim originating from an AI suggestion be accompanied by a short verification trace: (i) the transformation of the prompt, (ii) the intermediate computations or references used, and (iii) numerical checks for representative instances.
- Use modular, reproducible workflows (versioned code, notebooks, or small scripts) so other researchers can replay and audit AI-assisted steps.
5.2. Educational Opportunities and Assessment Design
- Integrating AI-fluency modules that train students to evaluate, test, and correct AI outputs rather than accept them uncritically.
- Designing assessments that emphasize higher-order skills (proof strategy, model-building, explanation, and verification) which are robust to superficial AI completion [18].
- Replacing adversarial detection with assessment redesign: prefer oral viva, incremental submissions, and reproducible notebooks that show the student’s process over single, static submissions [18].
5.3. Institutional Policy: Disclosure, Verification, and No-Oracle Rules
- Prohibit AI authorship. Since AI systems cannot take responsibility, they must not be listed as authors; this is the prevailing position of leading journals and ethics committees [14].
- Do not use detector scores as sole evidence. Given well-documented false positives and biases in detectors, institutions should not base disciplinary actions on detector outputs alone; instead use human review, process-based inspection (version history, logs, notebooks), and direct verification [14,16,17,19].
- Protect confidential research. Researchers should not input unreleased or sensitive manuscript content into public LLM interfaces; this concern is highlighted by institutional warnings and guidelines on AI use [15].
- Support training and infrastructure. Universities should provide access to vetted AI services (on-premise or privacy-respecting APIs), reproducible compute environments, and training for faculty and students on responsible AI use [18].
5.4. Why This Matters: Logical Justification
- Policing inhibits innovation. If researchers fear that using AI—even responsibly and with disclosure—will trigger reputational harm or rejection, they will avoid experimenting with tools that could accelerate discovery. This is especially damaging in mathematics, where computational exploration often suggests conjectures and heuristics that lead to proofs.
- Proof is the final arbiter. In mathematics correctness is determined by proof and verification, not by the provenance of a draft. Institutional practice should therefore privilege verification workflows (proofs, checks, reproducible computations) over stylistic authorship attributions.
5.5. Practical Checklist for Journals and Departments
- Require an AI usage statement in submissions and student portfolios. (What was used and for which step?)
- Require reproducible artefacts: code, notebooks, seeds, and small test inputs for any AI-assisted computation.
- Use detector tools only as triage aids (e.g., to flag items for manual review), never as sole evidence for adjudication.
- Provide mechanisms for appeal and human review when detectors are used.
- Train faculty and students in AI literacy and verification techniques (numerical checks, CAS validation, formal tools).
6. Case Studies and the Necessity of Professional AI Use
- Supervise questions and answers where AI tools have been used.
- Evaluate AI-assisted contributions for correctness, completeness, and alignment with the community’s standards.
- Revise or provide feedback on contributions that do not meet quality standards, rather than removing them outright.
7. Conclusion: Embracing AI as a Professional Scientific Tool
8. Future Research Directions: AI as a Catalyst for Mathematical Discovery
8.1. AI-Guided Exploration of Conjectures
- Developing AI-driven frameworks to **systematically test conjectures** by generating and verifying instances, computing numerical evidence, and suggesting possible generalizations.
- Combining symbolic reasoning, formal proof assistants, and large language models to **propose candidate theorems** and check their logical coherence before human verification.
- Leveraging AI to identify **heuristics or patterns** that might remain invisible to traditional approaches, thus accelerating the pathway from conjecture to proof.
8.2. Expanding Number Theory Techniques with AI
- Creating AI-assisted methods to discover, refine, and organize lemmas, corollaries, and proof strategies in number theory.
- Establishing reproducible pipelines where AI suggestions are **verified, iterated, and incorporated** into formal proofs, ensuring logical rigor without fatal gaps.
- Designing experiments to **benchmark AI’s impact** on long-standing open problems, demonstrating its ability to accelerate discovery while preserving mathematical correctness.
8.3. Bridging Human Expertise and AI Capabilities
- Researchers can explore vast combinatorial or number-theoretic spaces that are otherwise infeasible manually.
- AI can serve as a testbed for conjectures, providing preliminary evidence, counterexamples, or structured guidance for further investigation.
- This symbiotic approach allows the community to advance knowledge faster, transforming “currently open” problems into tractable challenges within a rigorously controlled framework.
Acknowledgments
References
- Silver, A. Huang, C. J. Maddison, et al., “Mastering the game of Go with deep neural networks and tree search,” Nature, 529:484–489, 2016. [CrossRef]
- D. Silver, T. Hubert, J. Schrittwieser, et al., “A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play,” Science, 362(6419):1140–1144, 2018. [CrossRef]
- J. Jumper, R. Evans, A. Pritzel, et al., “Highly accurate protein structure prediction with AlphaFold,” Nature, 596:583–589, 2021. [CrossRef]
- A. Davies, P. Veličković, L. Buesing, et al., “Advancing mathematics by guiding human intuition with AI,” Nature, 600:70–74, 2021. [CrossRef]
- A. Lewkowycz, A. Andreassen, D. Dohan, et al., “Solving Quantitative Reasoning Problems with Language Models,” arXiv:2206.14858, 2022. arXiv:2206.14858.
- T. Trinh, H. Le, A. Jain, et al., “Solving Olympiad Geometry Without Human Demonstrations,” arXiv:2404.06405, 2024. arXiv:2404.06405.
- T. Trinh, H. Le, A. Jain, et al., “AlphaGeometry-II: Large Language Model Guided Symbolic Deduction for Geometry Theorem Proving,” arXiv:2502.03544, 2025. arXiv:2502.03544.
- G. Carleo and M. Troyer, “Solving the quantum many-body problem with artificial neural networks,” Science, 355(6325):602–606, 2017. [CrossRef]
- MathOverflow Help Center, “What is this site’s policy on content generated by generative artificial intelligence tools?” https://mathoverflow.net/help/gen-ai-policy.
- Stack Overflow Help Center, “What is this site’s policy on content generated by generative AI tools?” https://stackoverflow.com/help/ai-policy.
- Turnitin Blog, “Understanding false positives within our AI writing detection capabilities,” Mar 16, 2023. https://www.turnitin.com/blog/understanding-false-positives-within-our-ai-writing-detection-capabilities.
- Vanderbilt University, “Guidance on AI Detection and Why We’re Disabling Turnitin’s AI Detector,” Aug 16, 2023. https://www.vanderbilt.edu/brightspace/2023/08/16/guidance-on-ai-detection-and-why-were-disabling-turnitins-ai-detector/.
- MathOverflow. “Is there an elegant recursive formula for ak=∑i=kk21i?” MathOverflow, 2024. https://mathoverflow.net/q/499543.
- L. Giray, “The Problem with False Positives: AI Detection Unfairly Accuses Scholars of AI Plagiarism,” The Serials Librarian, vol. 88, no. 1, pp. 27–34, 2024. [CrossRef]
- Stanford University study (reported by The Markup), “AI Detection Tools Falsely Accuse International Students of Cheating,” The Markup, Aug 14, 2023. https://themarkup.org/machine-learning/2023/08/14/ai-detection-tools-falsely-accuse-international-students-of-cheating.
- A. M. Elkhatat, K. Elsaid, and S. Almeer, “Evaluating the efficacy of AI content detection tools in differentiating between human and AI-generated text,” International Journal for Educational Integrity, vol. 19, no. 1, pp. 1–16, 2023. [CrossRef]
- Tufts, X. Zhao, L. Li, et al., “A Practical Examination of AI-Generated Text Detectors for Large Language Models,” arXiv:2412.05139 [cs.CL], 2024. arXiv:2412.05139.
- M. S. Akbar, et al., “Beyond Detection: Designing AI-Resilient Assessments with Automated Feedback Tool to Foster Critical Thinking,” arXiv:2503.23622 [cs.EDU], 2025. arXiv:2503.23622.
- H. Dixon and R. Clements, “The failures of LLM-generated text detection: false positives dilute the efficacy of AI detection,” Center for AI and Data Ethics, University of San Francisco, 2024. https://www.usfca.edu/sites/default/files/2024-05/ai_detection_case_study.pdf.
- R. Zeraoulia, “On the Hughes–Keating–O’Connell Conjecture: Quantified Negative Moment Bounds for ζ′(ρ) via Entropy–Sieve Methods Revisited,” Preprints 2025, 2025090489. [CrossRef]

| k | |||
|---|---|---|---|
| 1 | 1.000000 | 0.000000 | 1.000000 |
| 2 | 1.083333 | 0.693147 | 0.390186 |
| 3 | 1.328968 | 1.098612 | 0.230356 |
| 4 | 1.547396 | 1.386294 | 0.161101 |
| 5 | 1.732625 | 1.609438 | 0.123187 |
| 6 | 1.902709 | 1.791759 | 0.110950 |
| 7 | 2.058639 | 1.945910 | 0.112729 |
| 8 | 2.204522 | 2.079442 | 0.125080 |
| 9 | 2.342139 | 2.197225 | 0.144914 |
| 10 | 2.472756 | 2.302585 | 0.170171 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).