User talk:Maxal

Welcome!

Hello, Maxal, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are a few good links for newcomers:

I hope you enjoy editing here and being a Wikipedian! Please sign your name on talk pages using four tildes (~~~~); this will automatically produce your name and the date. If you need help, check out Wikipedia:Where to ask a question, ask me on my talk page, or place {{helpme}} on your talk page and someone will show up shortly to answer your questions. Again, welcome!

Binomial coefficient

I will write to you on Talk:Binomial coefficient. Oleg Alexandrov 22:33, 13 Apr 2005 (UTC)

I wrote more there. Oleg Alexandrov 23:03, 13 Apr 2005 (UTC)

And I wrote more... Oleg Alexandrov 23:15, 13 Apr 2005 (UTC)

More welcome

I think we differ in nothing but whether the emphasis should be on more elementary stuff first, or whether one should go general fully upfront. I suggest we let this cool down a bit.

Once again, welcome aboard. You might consider putting Wikipedia:WikiProject Mathematics on your watchlist, as it is there where the math people talk all kinds of issues related to math on Wikipedia. There is also a list of participants to sign on. Some good reading is Wikipedia:How to write a Wikipedia article on Mathematics — the product of more than three years of collaborative thinking. Hope you like it here — Oleg Alexandrov 00:27, 14 Apr 2005 (UTC)

Polya enumeration theorem

On February 1 you mentioned on the talk page that you would create a Spanish-language stub. Did you ever do that, and if so, could you by any chance add the link to the Spanish page, please? --N Shar (talk · contribs) 02:02, 21 August 2008 (UTC)[reply]

I did around that time (and moved related links there) but it was then removed by some Spanish user. Check up the history log. Maxal (talk) 06:42, 21 August 2008 (UTC)[reply]

Pascal's rule

Why the need to delete the proof of (n+1 over k+1) = (n over k) + (n over k+1)? This particular expression is not mentioned in the Pascal's rule article, the proof mentioned there is (n over k) = (n-1 over k) + (n-1 over k-1). So I cannot se why it really is neccesary to delete this part? Emul0c (talk) 10:13, 10 November 2008 (UTC)[reply]

(n+1 over k+1) = (n over k) + (n over k+1) and (n over k) = (n-1 over k) + (n-1 over k-1) is exactly the same identity with just shifted (increased/decreased by 1) indices. As of deleting the part of binomial coefficient article - there are two reasons: 1) This proof (actually, even a couple of proofs) of the Pascal's rule is given in the Pascal's rule article, there is no need to repeat it/them in binomial coefficient - it's enough just to point out that the main article on this topic is the Pascal's rule one. 2) The binomial coefficient article is already too heavy to contain excessive material. Maxal (talk) 16:28, 10 November 2008 (UTC)[reply]

Graph isomorphism

Thank you for your interest in improving wikipedia articles. Please keep in mind that wikipedia is encyclopedia, not a web directory. Adding external links to someone's individual webpages is generally discouraged, unless the person in question is a known expert in the area. Twri (talk) 21:04, 2 March 2009 (UTC)[reply]

OK, it makes sense. Maxal (talk) 21:09, 2 March 2009 (UTC)[reply]

You currently appear to be engaged in an edit war according to the reverts you have made on Graph isomorphism. Note that the three-revert rule prohibits making more than three reversions on a single page within a 24 hour period. Additionally, users who perform a large number of reversions in content disputes may be blocked for edit warring, even if they do not technically violate the three-revert rule. If you continue, you may be blocked from editing. Please do not repeatedly revert edits, but use the talk page to work towards wording and content that gains a consensus among editors. If necessary, pursue dispute resolution. Even if your edits were otherwise acceptable, you cannot restore them that many times. — Arthur Rubin (talk) 22:50, 2 March 2009 (UTC)[reply]

Stop reverting my changes without explanation. Apply the three-revert rule to yourself. Maxal (talk) 22:51, 2 March 2009 (UTC)[reply]

The count of reverts is:

I won't revert again, but it would appreciated if you would self-revert your last revert, as you have now been warned that you were already in violation. — Arthur Rubin (talk) 22:57, 2 March 2009 (UTC)[reply]

My reverts were about different issues (and three of them are caused by you!). One issue was resolved, thanks to Twri, and should not be counted towards recent reverts. Maxal (talk) 22:59, 2 March 2009 (UTC)[reply]

You may have a legitimate concern, but you still need to discuss it, because others clearly disagree and will not allow you to add the link unilaterally. You need to argue for its inclusion on the talk page. Dcoetzee 23:44, 2 March 2009 (UTC)[reply]

The explanations first should have came from those who delete information, disregarding in a single mouse click much more significant efforts spent for collecting, formatting and bringing in this information. Anyway, I've started a discussion in Talk:Graph isomorphism#Software review. Maxal (talk) 00:24, 3 March 2009 (UTC)[reply]

Actually that's not how it works - see Wikipedia:BOLD, revert, discuss cycle. If someone disagrees with your change, it's always best to discuss it, unless they were very clearly mistaken. Dcoetzee 02:13, 3 March 2009 (UTC)[reply]

I'm responding to a report at WP:AN3 regarding your edit warring. In your favour I see that you have not reverted since the 3RR warning, and have taken the issue to the talk page. You should note that WP:3RR is not an entitlement, and editors may be blocked for edit warring even if they do not technically break 3RR. Note also that it does not matter if the reverts are of different material. If you continue edit warring on this, you will certainly be blocked. Kevin (talk) 02:54, 3 March 2009 (UTC)[reply]

3RR warning again

You currently appear to be engaged in an edit war according to the reverts you have made on Wieferich prime. Note that the three-revert rule prohibits making more than three reversions on a single page within a 24 hour period. Additionally, users who perform a large number of reversions in content disputes may be blocked for edit warring, even if they do not technically violate the three-revert rule. If you continue, you may be blocked from editing. Please do not repeatedly revert edits, but use the talk page to work towards wording and content that gains a consensus among editors. If necessary, pursue dispute resolution. — Arthur Rubin (talk) 02:09, 9 June 2009 (UTC)[reply]

And again you're the one who is opposing in the edit war and issuing me a 3RR warning. I should be doing the same for you... Maxal (talk) 03:41, 9 June 2009 (UTC)[reply]

Smith septuple

Thanks for adding my Smith septuple to Smith number. I didn't want to do it myself for conflict of interest reasons but had considered to suggest it. PrimeHunter (talk) 01:29, 24 December 2009 (UTC)[reply]

Sure. Maxal (talk) 16:10, 25 December 2009 (UTC)[reply]

Citation template

Hi, I see that you have edited some references in coin problem to use the {{cite ...}} template.I will not revert your edits, but please note that it was not only a waste of your time, but actually a significant *dis*improvement, as the reference became harder to read --- both in the wikisource and in the reader's view. The compact citation format 37(10):1-23 was invented by technical journal publishers *to save paper*. The extended format "volume 37, issue 10, pages 1-23" of the original citations is more suited to the medium and readership of Wikipedia. There are several other disadvantages of the cite templates, but that will do for now.
Like many (too many) other features in Wikipedia, the cite templates were created by a handful of enthusiastic editors without a clear analysis of cost/benefits, and posted by them as if they were a "consensus" --- which they most emphatically are *not*. Then editors started using them in the mistaken impression that they are somehow good for Wikipedia --- which they most emphatically are *not*. I used to do that myself until I realized the sheer idiocy of the templaets and what "consensus" usually means in the Wikipedia guidelines.
So my advice is that you format the references by hand and forget the "cite" templates. It will save you a lot of time and grief, and you will get better-looking refs. All the best, --Jorge Stolfi (talk) 02:13, 4 January 2010 (UTC)[reply]

Personally I see no problems with cite template format. But if you think it needs to be improved, please raise this question in Template talk:Cite journal. Maxal (talk) 05:32, 4 January 2010 (UTC)[reply]

Orphaned non-free image File:Science5807.gif

⚠

Thanks for uploading File:Science5807.gif. The image description page currently specifies that the image is non-free and may only be used on Wikipedia under a claim of fair use. However, the image is currently orphaned, meaning that it is not used in any articles on Wikipedia. If the image was previously in an article, please go to the article and see why it was removed. You may add it back if you think that that will be useful. However, please note that images for which a replacement could be created are not acceptable for use on Wikipedia (see our policy for non-free media).

If you have uploaded other unlicensed media, please check whether they're used in any articles or not. You can find a list of "file" pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "File" from the dropdown box. Note that any non-free images not used in any articles will be deleted after seven days, as described on criteria for speedy deletion. Thank you. Skier Dude (talk) 04:30, 6 January 2010 (UTC)[reply]

Last warning?

What this warning is about? Maxal (talk) 13:39, 7 January 2010 (UTC)[reply]

That was not me. Some anon from what I see. Oleg Alexandrov (talk) 17:27, 7 January 2010 (UTC)[reply]

OK. Then I can safely delete this cryptic impersonating comment. Maxal (talk) 22:56, 7 January 2010 (UTC)[reply]

Merging article Bracelet to Necklace (combinatorics)

I'm recommending that the article on Bracelet (combinatorics) be merged into Necklace (combinatorics).

I saw that you had previously edited one (or both) of these article. You're invited to participate in the discussion here: Talk:Necklace (combinatorics).

Thanks, Justin W Smith ^talk/_stalk 15:11, 14 May 2010 (UTC)[reply]

I have marked you as a reviewer

I have added the "reviewers" property to your user account. This property is related to the Pending changes system that is currently being tried. This system loosens page protection by allowing anonymous users to make "pending" changes which don't become "live" until they're "reviewed". However, logged-in users always see the very latest version of each page with no delay. A good explanation of the system is given in this image. The system is only being used for pages that would otherwise be protected from editing.

If there are "pending" (unreviewed) edits for a page, they will be apparent in a page's history screen; you do not have to go looking for them. There is, however, a list of all articles with changes awaiting review at Special:OldReviewedPages. Because there are so few pages in the trial so far, the latter list is almost always empty. The list of all pages in the pending review system is at Special:StablePages.

To use the system, you can simply edit the page as you normally would, but you should also mark the latest revision as "reviewed" if you have looked at it to ensure it isn't problematic. Edits should generally be accepted if you wouldn't undo them in normal editing: they don't have obvious vandalism, personal attacks, etc. If an edit is problematic, you can fix it by editing or undoing it, just like normal. You are permitted to mark your own changes as reviewed.

The "reviewers" property does not obligate you to do any additional work, and if you like you can simply ignore it. The expectation is that many users will have this property, so that they can review pending revisions in the course of normal editing. However, if you explicitly want to decline the "reviewer" property, you may ask any administrator to remove it for you at any time. — Carl (CBM · talk) 12:33, 18 June 2010 (UTC) — Carl (CBM · talk) 13:03, 18 June 2010 (UTC)[reply]

OK. Thanks! Maxal (talk) 16:03, 18 June 2010 (UTC)[reply]

Irrationality of the MRB constant

Hi maxal. I'm glad to see you helping improve the MRB constant article. You asked about the irrationality of the constant. That got me thinking and I wrote Steven Finch ( Clay Mathematics Institute Book Fellow and an expert on rationality and transcendence of constants), and he wrote me back with the following suggestion:

>Hi,
>Such proofs can be extremely difficult. Recall, for example,
>that the irrationality of the Euler-Mascheroni constant remains
>an open problem! I think you should say likewise for MRB,
>unless someone has actually written down a rigorous proof.
>Steve

Perhaps someone can explain that, somehow, in the article. — Preceding unsigned comment added by Marburns (talk • contribs) 19:38, 25 January 2011 (UTC)[reply]

If irrationality is not proved, it has to be stated as such. It is at least misleading to call a number irrational if its irrationality is not proved. Maxal (talk) 11:30, 26 January 2011 (UTC)[reply]
- Per WP:AB, in clear-cut case, I corrected the statement concerning irrationality.Marvin Ray Burns (talk) 20:12, 1 February 2011 (UTC)[reply]

The "since then" section to the MRB constant article

From your edit summary I take it that you thought the references used in saying the MRB constant has been put in tables at such and such place are not widely accepted in a scholarly atmosphere. However, I think they are more like original source references and are therefore useful. They aren’t merely telling you that someone in authority said the constant was used in those tables, but rather one can check for him or herself that it was in there. Furthermore, those were not just tables that were copies of Wikipedia’s table (like there are many of now) but they were developed before the MRB constant was put on Wikipedia and thus show how the knowledge of the MRB constant was passed around before it was on Wiki. In fact, at my personal website I have a strong Iranian following from the Iranian table. I’m not saying you really should restore those lines that you deleted; I’m only asking that you consider either doing that or perhaps adding a better clause to the article to convey the same information. Best wishes, Marvin Ray Burns (talk) 05:46, 4 February 2011 (UTC)[reply]

First, those tables are not WP:reliable sources. Second, it is not notable whether the constant is mentioned there. Maxal (talk) 12:06, 4 February 2011 (UTC)[reply]

Irrational number page

Hi agin Maxal. I was wondering if you thought the MRB constant could be included in the Open questions section of the Irrational number page where there it says the following: It is not known whether πe, π/e, 2^e, π^e, π^√2, ln π, Catalan's constant, or the Euler–Mascheroni gamma constant γ are irrational.^[1]^[2]^[3]
I have posed the issue of the irrationallity of MRB at http://www.mapleprimes.com/posts/101425-Could-The-MRB-Constant-Be-Rational. Well that's all for now, Marvin Ray Burns (talk) 16:44, 5 February 2011 (UTC)[reply]

References

Reversion of your edits in the article Wieferich prime

I reverted your last contribution to the article Wieferich prime. Please see that articles talk page for my reasoning behind this. Also note that I assume good faith on your part. Feel free to discuss. Thanks. Toshio Yamaguchi (talk) 10:50, 29 March 2011 (UTC)[reply]

Thanks for clarification

Thanks for clarifying the last entry in the 'Properties of Wieferich primes' section. I guessed it was meant to say ≡ rather than =, but wasn't 100% sure, since I didn't add it. Cheers. Toshio Yamaguchi (talk) 19:42, 30 March 2011 (UTC)[reply]

A Barnstar for you

		The Original Barnstar
		Hi, just thought I let you know that I appreciate your contributions, especially those to Wieferich prime and Wolstenholme prime. Also thanks for your good explanations, such as those on Talk:Wieferich prime and your patience with regards to some of my edits and objections related to these articles. Keep up the good work. Toshio Yamaguchi (talk) 04:21, 16 April 2011 (UTC)[reply]

Thanks! Maxal (talk) 05:55, 16 April 2011 (UTC)[reply]

Sources moved

Hi Maxal,

I copied some of the sources from Wolstenholme prime over to Regular prime, namely those about irregular primes, which are not relevant to Wolstenholme primes. The article Regular prime might look a bit messy now. I will try to clean that up a bit. Toshio Yamaguchi (talk) 11:20, 13 May 2011 (UTC)[reply]

I cleaned that up and moved some of the sources to the appropriate sections. Think it looks better now. Toshio Yamaguchi (talk) 14:45, 13 May 2011 (UTC)[reply]

Talkback

Replied at my talkpage. Toshio Yamaguchi (talk) 21:56, 25 December 2011 (UTC)[reply]

Dorais and Klyve definition of a near Wieferich prime

It currently says the third column is $\left|{\tfrac {\omega (p)}{p}}\right|\times 10^{14}$ . Shouldn't that be $\left|{\tfrac {A}{p}}\right|\times 10^{14}$ ? -- Toshio Yamaguchi (tlk−ctb) 17:20, 12 May 2012 (UTC)[reply]

I don't think so -

\omega (p)

in the second definition is different from A used in the first definition of a near-Wieferich prime. Maxal (talk) 17:51, 12 May 2012 (UTC)[reply]

We can rewrite the second definition though in the same manner as the first definition using, say, B in place of A. Maxal (talk) 17:53, 12 May 2012 (UTC)[reply]

When I take for example the near Wieferich prime 765760560131939 (the first near Wieferich prime in the table in the paper with A ≠ 0) and compute

{\tfrac {76}{765760560131939}}

(which corresponds to

\left|{\tfrac {A}{p}}\right|

) I get approximately

9.92477\times 10^{-14}

. Multiplying that value with

10^{14}

I get 9.92477..., which thus corresponds to

\left|{\tfrac {A}{p}}\right|\times 10^{14}

and would be the value in the third column of the second table. So what exactly is the difference between

\omega (p)

and A? (Note that Dorais and Klyve also use A in their paper, see for example page 11). The only difference between their A and that in the previous definition (used by Crandal, Dilcher, Pomerance and Knauer, Richstein) seems to be that the exponent on the left side of the congruence isn't divided by 2. I believe that is the reason why for example when checking 6517506365514181 with wwww I get an A value of −29, while Dorais and Klyve get +58, which is exactly 2 × |−29|. I agree that we should perhaps use B in the second table. -- Toshio Yamaguchi (tlk−ctb) 21:46, 12 May 2012 (UTC)[reply]

In our cases (when A is relatively small as compared to p), we have

\omega (p)=2A

as you noticed. The reason is that if

2^{\tfrac {p-1}{2}}\equiv 1+Ap{\pmod {p^{2}}}

, then

2^{p-1}\equiv \left(2^{\tfrac {p-1}{2}}\right)^{2}\equiv (1+Ap)^{2}\equiv 1+2Ap{\pmod {p^{2}}}

and thus

{\tfrac {2^{p-1}-1}{p}}\equiv 2A{\pmod {p}}

. Maxal (talk) 10:37, 13 May 2012 (UTC)[reply]

Repunits

Hi Maxal,

In your contribution on Repunits, you make the following statement:

"Any positive multiple of the repunit R_n^(b) contains at least n nonzero digits in base b."

I found this statement intriguing and not at all obvious. Is this an old, classic result? Do you have a reference for it?

Thanks in advance, Sgwagner (talk) 22:22, 13 October 2012 (UTC)[reply]

See discussion at [1]. Maxal (talk) 23:12, 13 October 2012 (UTC)[reply]

ArbCom elections are now open!

Hi,
You appear to be eligible to vote in the current Arbitration Committee election. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate, you are welcome to review the candidates' statements and submit your choices on the voting page. For the Election committee, MediaWiki message delivery (talk) 13:00, 23 November 2015 (UTC)[reply]

ArbCom Elections 2016: Voting now open!

Hello, Maxal. Voting in the 2016 Arbitration Committee elections is open from Monday, 00:00, 21 November through Sunday, 23:59, 4 December to all unblocked users who have registered an account before Wednesday, 00:00, 28 October 2016 and have made at least 150 mainspace edits before Sunday, 00:00, 1 November 2016.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2016 election, please review the candidates' statements and submit your choices on the voting page. MediaWiki message delivery (talk) 22:08, 21 November 2016 (UTC)[reply]

ArbCom 2017 election voter message

Hello, Maxal. Voting in the 2017 Arbitration Committee elections is now open until 23.59 on Sunday, 10 December. All users who registered an account before Saturday, 28 October 2017, made at least 150 mainspace edits before Wednesday, 1 November 2017 and are not currently blocked are eligible to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2017 election, please review the candidates and submit your choices on the voting page. MediaWiki message delivery (talk) 18:42, 3 December 2017 (UTC)[reply]

ArbCom 2018 election voter message

Hello, Maxal. Voting in the 2018 Arbitration Committee elections is now open until 23.59 on Sunday, 3 December. All users who registered an account before Sunday, 28 October 2018, made at least 150 mainspace edits before Thursday, 1 November 2018 and are not currently blocked are eligible to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2018 election, please review the candidates and submit your choices on the voting page. MediaWiki message delivery (talk) 18:42, 19 November 2018 (UTC)[reply]

Nomination of Polydivisible number for deletion

A discussion is taking place as to whether the article Polydivisible number is suitable for inclusion in Wikipedia according to Wikipedia's policies and guidelines or whether it should be deleted.

The article will be discussed at Wikipedia:Articles for deletion/Polydivisible number until a consensus is reached, and anyone, including you, is welcome to contribute to the discussion. The nomination will explain the policies and guidelines which are of concern. The discussion focuses on high-quality evidence and our policies and guidelines.

Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion notice from the top of the article. Prova-nome (talk) 03:07, 9 October 2019 (UTC)[reply]

ArbCom 2019 election voter message

Hello! Voting in the 2019 Arbitration Committee elections is now open until 23:59 on Monday, 2 December 2019. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2019 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:04, 19 November 2019 (UTC)[reply]

Disambiguation link notification for October 24

Hi. Thank you for your recent edits. An automated process has detected that when you recently edited Continued fraction, you added a link pointing to the disambiguation page Rational approximation. Such links are usually incorrect, since a disambiguation page is merely a list of unrelated topics with similar titles. (Read the FAQ • Join us at the DPL WikiProject.)

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 06:18, 24 October 2020 (UTC)[reply]

ArbCom 2020 Elections voter message

Hello! Voting in the 2020 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 7 December 2020. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2020 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 01:14, 24 November 2020 (UTC)[reply]

ArbCom 2021 Elections voter message

Hello! Voting in the 2021 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 6 December 2021. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2021 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:08, 23 November 2021 (UTC)[reply]

ArbCom 2022 Elections voter message

Hello! Voting in the 2022 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 12 December 2022. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2022 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:27, 29 November 2022 (UTC)[reply]

ArbCom 2023 Elections voter message

Hello! Voting in the 2023 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 11 December 2023. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2023 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:22, 28 November 2023 (UTC)[reply]

[1] Weisstein, Eric W. "Pi". MathWorld.

[2] Weisstein, Eric W. "Irrational Number". MathWorld.

[3] Some unsolved problems in number theory

[1]

[2]

[3]