The Propositional Lattice of Divisibility and Beal's Conjecture
Journal of Advances in Mathematics and Computer Science · pp. 1–8 · Published 23 May 2017
10.9734/BJMCS/2017/33315Abstract
This article is devoted to the lattice-theoretic analysis of Beal's conjecture. We discuss whether this conjecture is deducible from the laws of logic of divisibility.
References (4)
Cited by 0
No indexed citations yet.
Related research
- Proposition of a Recursive Formula to Calculate the Higher Order Derivative of a Composite Function without Using the Resolution of the Diophantine Equation — shares topic coverage
- On the Diophatine Equation \( a b(c d+1)+L=u^{2}+v^{2}\) — shares topic coverage
- Some Formulae for Integer Sums of Two Squares — shares topic coverage
- Encryption with Generalised Balancing Sequences and Generalised Lucas Balancing Sequences — shares topic coverage
- Some Generalized Formula For Sums of Cube — shares topic coverage
Article metrics
Real usage data collected on this platform.
10
Page views
0
PDF downloads
7
Outbound clicks
0
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.