LissafiKafin bugawaNazariyyaKaratun minti 3

JERIN LAMBOBI SHIDA MARA ƘARSHE DA BA YA TAƁA DAIDAITUWA

Rubuta jerin lambobin ƙirge (whole numbers), ɗaya bayan ɗaya. Yanzu nemi gunduwoyi biyu maƙwabta masu tsawo ɗaya da jimilla ɗaya. A cikin 1 4 2 3, gunduwoyin 1 4 da 2 3 kowannensu yana da lambobi biyu, kuma jimillar kowannensu 5 ce: masana lissafi suna kiran irin wannan ma’aurata murabba’in tarawa (additive square).

Shin jeri mara iyaka, wanda aka rubuta da rukunin lambobi masu iyaka (finite), zai iya kauce wa kowane murabba’in tarawa, har abada? An yi wannan tambayar ta fuskoki daban-daban tun 1972 — daga Justin, sannan Brown da Freedman a 1987, Pirillo da Varricchio a 1994, Halbeisen da Hungerbühler a 2000. Brown da Freedman ma sun yi hasashen akasin haka: cewa kowane jerin lambobin ƙirge masu kyau (positive) da ba sa wuce wata iyaka dole ne ya ƙunshi ɗaya. Sabuwar takardar ta kira shi “matsalar da ta kasance a buɗe fiye da shekaru 50”.

Lambobi shida da ba sa taɓa daidaituwa

Yanzu takardar Jeffrey Shallit, daga Sashen Kimiyyar Kwamfuta (School of Computer Science) na Jami’ar Waterloo (University of Waterloo) a Kanada, ta rubuta takamaiman jeri mara iyaka wanda ke amfani da lambobi shida daidai, kuma babu murabba’in tarawa a cikinsa.

“Haruffa” (letters) shidan nan ba ƙanana ba ne ko kaɗan. Idan D = 2⁵⁸, L = 2 · 85¹¹, H = 2D + 1 da U = L³ + 1, su ne:

1, U + 1, U + 2, U + L + 1, U + L² + 1 da (H + 2)U + 1.

Na farkon ne kaɗai ƙarami. Takardar ta ba da ƙa’idar samun lambar da ke kowane matsayi, tare da gwaje-gwaje: lamba 1 tana fara bayyana a matsayi na 1,152,921,504,466,744,130, idan an fara ƙirga daga sifili.

Yadda hujjar take aiki

Ginin yana da matakai biyu.

  1. Jeri mai taimako (auxiliary sequence). A fara daga lamba ɗaya, sannan a maye gurbin kowace lamba, akai-akai, da gunduwar lambobi 2⁶⁰. An tsara gunduwoyin ta yadda idan wannan jeri ya ƙunshi murabba’in tarawa, zai kuma ƙunshi murabba’i mafi gajarta sau 2⁶⁰. A zaɓi murabba’i mafi gajarta da ke akwai: dole ne wani wanda ya fi shi gajarta ya kasance. Wannan saɓani (contradiction) yana nuna cewa babu murabba’i ko ɗaya.
  2. Rubutun sirri (code) na lambobi shida. Sannan a rubuta jeri mai taimakon da lambobin shida, ta amfani da wani tsari na alamomi huɗu da Peltomäki da Whiteland suka gano, wanda shi kansa an gina shi a kan wata musanya (substitution) ta alamomi 85 da aka samu daga Veikko Keränen. Manyan gibin da ke tsakanin lambobin shida suna sa a iya karanta kowace jimilla, kamar lambobi (digits) a cikin wani tushen lissafi (base) mai girma ƙwarai: duk wani murabba’i a cikin jeri na ƙarshe zai tona asirin wani murabba’i a cikin jeri mai taimakon.

Huɗu, biyar ko shida?

Ba a sani ba ko shida ne mafi ƙanƙanta. Wani nau’in maimaitawa, murabba’i na abelian (abelian square), gunduwa ce da ke biye da kwafinta da aka jujjuya tsarin abubuwanta, kamar 1 2 3 3 1 2. Rabi-rabinsa biyu suna ɗauke da lambobi iri ɗaya, don haka kullum jimillarsu ɗaya ce: kowane murabba’i na abelian murabba’in tarawa ne kuma. Da lambobi daban-daban uku kawai, ba za a iya kauce wa murabba’ai na abelian ba — don haka ana buƙatar akalla lambobi huɗu. Saboda haka mafi kyawun adadi shi ne 4, 5 ko 6. “Ya rage a tantance wanne ne daidai,” in ji ƙarshen takardar.

Rubutun na’ura, sa hannun Jeffrey Shallit

Takardar ta ƙare da wani “Statement of AI Usage” (Bayani kan Amfani da AI): “Kusan dukkan wannan takarda GPT 6.2 Astra ce ta rubuta ta.” An ƙara gabatarwa, manazarta da tattaunawa ta hannun Shallit, kuma rubutun Shallit ya ce: “Na ɗauki cikakken alhaki kan ingancinta.” An wallafa a intanet wani tantancewar kwamfuta (computer verification) na ginin, wanda aka rubuta da harshen Lean kuma ana sake gudanar da shi da umarni guda ɗaya — “shi ma GPT 6.2 Astra ce ta gina shi.” Takardar tana da shafuka takwas kuma har yanzu ba a yi mata bitar takwarorin masana (peer review) ba.