User talk:MFH

Wikipedia:Babel

de

Dieser Benutzer spricht Deutsch als Muttersprache.

fr-5

Cet utilisateur parle français à un niveau professionnel.

en-4

This user can contribute with a near-native level of English.

gsw-1

Dä Benutzer redet es bizzeli Schwizerdütsch.

Search user languages

Welcome to my talk page! Click here to drop me a message, or edit any existing section to add a comment.

Note that I try to organize this a bit. If you came here for something you can't find anymore, it's most probably in one of the subcategories like /math, /phil or /wiki.

All such subpages are linked to below under a corresponding "toplevel category" section title (e.g. "Mathematics").

Sorry for any inconvenience. (Feel free, anyway, to drop me a message about any subject on the bottom of this page.)

Original Welcome message

Welcome!

Hello, MFH, 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!

Thanks for your contribution to sequence. Just one note, you don't need to write the underscore in net (topology); as the wikipedia software will do it for you.

Enjoy! Oleg Alexandrov 23:03, 8 Mar 2005 (UTC)

I knew I didn't need to, but I thought it would "save server resources".

Admittedly, it looks ugly, and if usage is such, I won't put it ever again.

MFH 01:59, 10 Mar 2005 (UTC)

(continued on /phil#Welcome)

Mathematics

Comments concerning mathematics now are found at User talk:MFH/math.

Philosophical discussions and such

Philosophical, epistemological and similar discussions (from discussions about usage of punctuation marks to the meaning of life and the universe) now are found at User talk:MFH/phil.

Wikipedia related

User talk about wiki technicalities: "do"s and "don't"s, from netiquette to browser problems, is now mainly found at User talk:MFH/wiki (but might also be in User talk:MFH/phil).

Various

The remainder of this page concerns either things not not belonging to one of the preceding categories, or juste those recent messages I had not yet time to move to the archive.

sesquipedalianism

I haven't updated that link -- try Longest word in English#Jokes. Mike ∞Storm 01:19, 13 May 2005 (UTC)[reply]

WP' style formal definition

Now if I really think of it, do we indeed always need to put formal definitions? Somehow, I always thought that what Wikipedia should be about is having a fine collection of essays about mathematics written at an accessible level. And an essay should not always be rigurious or formal. But this is my own very private opinion. I wonder how people indeed think of this issue. Oleg Alexandrov 23:24, 24 May 2005 (UTC)[reply]

You must know of pages (eg Talk:Polynomial) from where it is clear that much more than 1% (I estimate at least 30%) of all writers of math articles do not agree.

And I referred to a WP guideline (How to...in mathematics.)

And the definition of "definition" (not equal to "explanation") and "encyclopedia" (not equal to "collection of essays") do not depend on our opinions. — MFH: Talk 00:19, 25 May 2005 (UTC)[reply]

Got it. I just don't like when articles get burdened with too much rigor as that usually makes them less penetrable to nonmathematicians. By the way, I replied on my talk page to your "subject" question. Oleg Alexandrov 21:55, 25 May 2005 (UTC)[reply]

Red links

User:Charles Matthews/red links is just a collection of fairly interesting links, from a few places (the Dieudonné analysis books, Griffiths & Harris are two I went through). It is a 'project page' like any other, in the sense that anyone can use the suggestions. Redirecting is OK, in general. Charles Matthews 14:26, 25 May 2005 (UTC)[reply]

empty product

The following program woud be indeniably better:

sum := x(1)

prod := x(1)

for i := 2 to 10 do

sum := sum + x(i)

prod := prod * x(i)

I maintain that this philosophical "problem" has its root in the question of counting: Do you start with the first member to count, or before counting the first member. — MFH: Talk 23:32, 21 Jun 2005 (UTC)

PS: indeed, depending on what are the objects to sum and multiply, O and 1 are not the same. E.g. a computer algebra program could give you an error if the x(i) were matrices and it would not allow the scalar 0 (resp 1) to be added to (resp multiplied by) a matrix. But I agree on the following:

The empty sum (resp. product) of objects in X should be the neutral element for addition (resp multiplication) in X.

Remains to know what is the neutral element for the (cartesian) product of sets. — MFH: Talk

Who ever said there's either a problem or a matter of philosophy? Your quotation marks around "problem" make it look as if someone other than you saw a problem here, or otherwise used that word. Michael Hardy 23:51, 21 Jun 2005 (UTC)

PS: "Indeniably"? Did you mean "undeniably"? Certainly your algorithm is NOT better, since it incorrectly starts the sum at 1 rather than 0. Michael Hardy 23:51, 21 Jun 2005 (UTC)

No, you are wrong (not on "undeniably", though): The task is to add and multiply items x(i) starting with x(1). And, as I said, the other program is not correct since 0 and 1 are not necessarily of the same type than the x(i).

Indeed, I put "problem" since it is not a true problem, just a matter of convention. Not even a convention about the contents (where all agree upon), but just on how to speak about... just a naming convention, in some sense. — MFH: Talk 00:00, 22 Jun 2005 (UTC)

Quasilinear

When googling quasilinear, there are many links to "Quasilinear Parabolic/Elliptic Differential Equations". Since I don't know what they are, or if they are related to your O(...) functions, let's make a disambiguation page. --J heisenberg 12:47, 23 Jun 2005 (UTC)

No this is not related at all. For the DE quasilinear means that the coefficients are not constants but (given) functions. For the growth/complexity, quasilinear means O( n^a ) for all a>1 (or more restrictedly O( n log n)). — MFH: Talk 13:03, 23 Jun 2005 (UTC)

WikiFun Round 9: Lightning Round Time

I have decided to attempt to advance and end the round quickly. Parts of the question will be revealed with more hints and/or be more elaborated on as every two days. I have currently provided more hints on the answer pages for the current remaining questions. --AllyUnion (talk) 08:32, 6 August 2005 (UTC)[reply]

Please vote

Hello. Please vote at Wikipedia:Featured list candidates/List of lists of mathematical topics. Michael Hardy 22:58, 14 October 2005 (UTC)[reply]

Definition of a series

Hi MFH, I've just replied to an issue you raised on Talk:Series (mathematics) back in April. Whaddaya think? Melchoir 02:21, 5 December 2005 (UTC)[reply]

Wikipedia:Wikifun

Hi, I've noticed you've taken part in Wikifun before.

Just to let you know, Round 11 begins today at 0900 GMT. Dmn 04:26, 8 December 2005 (UTC)[reply]

Wikifun round 12

This is to invite you to participate in the next game of Wikifun.
Round 12 will begin at 11:00 UTC on Friday January 20. 2006.
-- Ravn 17:19, 18 January 2006 (UTC)[reply]

Reverting

It's easy - click on history, then on the version you want to revert to. Edit that page and ignore the warning message, then submit the page without modifying it. The Help:Contents section is a good place to find information like this. Let me know if you have any more questions. Feezo 22:22, 17 February 2006 (UTC)[reply]

Biscuit Tortoni

Biscuit Tortoni is not a brand name, it is a type of ice cream dish like baked alaska. I will change the stub categorization to {{dessert-stub}}. Thanks for being bold! -- Avi 03:21, 23 February 2006 (UTC)[reply]

Congratulations!

You've just won round 12 of Wikifun! :) Would you like to devise the villa^Wquestions for the next round? Oh, and what's your favourite flavour of Kellogg's and where should it be shipped to? -- Ravn 20:17, 7 March 2006 (UTC)[reply]

(answered on User talk:Ravn) — MFH:Talk 23:05, 7 March 2006 (UTC)[reply]

Re:mind bending

I guess the page isn't clear enough... You have to answer the questions, and if you want, review some articles. I see the questions are a bit hidden. I hope you participate! Here are the instructions:

Question set 1 (created by myself)
Question set 2 (created by Celestianpower)

There are also some fake articles that may serve for background on answering the questions.

Article for Set 1
Article for Set 2

You can also review these articles, it's very simple. Just read them and place a new section on the talk page ("Evaluation by MFH") giving a score from 1 to 10 for each section:

   * Comprehensiveness
   * Creativity
   * Likeness in formatting to actual article
   * Graphics
   * Wording/Style
   * Humor
   * Overall
   * Other comments (this should not have a score :) )

Having that said, what can I do to explain that better on the WP:MIND page? I was thinking in joining the two sets and tallies on one, it would be much better. Any suggestions on the format, scoring, etc. would be appreciated (and needed).

P.S: By the way, if you can't answer any of the questions I have some hints ready to be put soon. F e tofs ^Hello! 23:55, 7 March 2006 (UTC)[reply]

Wikifun talk

It coincided with Wikipedia crashing, so I assumed the page was blanked as a result of the bug. In fact Wikifun talk page was the first page I saw during the time that Wikipedia was malfunctioning, and it looked like it never existed. So you can understand why I thought that the blanking was not deliberate. Grue 22:03, 14 March 2006 (UTC)[reply]

Re:Cryptography

What question? If you believe you have the right answer you can tell me and I'll give you the points anyway... F e tofs ^Hello! 23:17, 31 March 2006 (UTC)[reply]

You can do the questions, however you won't get the article bonus points for writing an article; I could still get you 1 to 3 points for helping out. F e tofs ^Hello! 22:36, 6 April 2006 (UTC)[reply]

Vandal 165.234.189.213

Thank you for letting me know. Unfortunately I am not a sys-op and can't block. I'll keep an eye on it but luckily it looks like that IP address has been dormant for a few days now. -- Renesis13 05:45, 4 April 2006 (UTC)[reply]

Trees instead of taxoboxes

I like the idea of trees instead of taxoboxes, is there some way they can created by code in Wikipedia, though? The can also be easily used to show questionable relationships, or plop two competing trees down. They're much easier to grasp, imo, than taxoboxes, yet the latter remain useful in the absence of trees, when done correctly. KP Botany 20:15, 3 November 2006 (UTC)[reply]

Haag-Lopuszanski-Sohnius theorem

Name: Martin Sohnius
Email: msohnius@ followed by novell.com
Subject: Haag-Lopuszanski-Sohnius Theorem
***
Thanks for putting my name into Wikipedia!  It feels good, after all these years.

Martin

I just received the above message, which I believe was meant for you. I started the talk page of the article, while you started the article itself; I think he got the histories of the two confused. Mike Peel 17:22, 5 December 2006 (UTC)[reply]

Wikifun

Round 14 is starting just about now. --Spondoolicks 16:58, 10 April 2007 (UTC)[reply]

Well what can I say? You've got to stay on your toes in the fast-moving world of Wikifun :) Hopefully we won't be waiting the best part of a year for the next round this time. --Spondoolicks 14:29, 23 April 2007 (UTC)[reply]

No content in Category:Images of kitchenware

Hello, this is a message from an automated bot. A tag has been placed on Category:Images of kitchenware, by another Wikipedia user, requesting that it be speedily deleted from Wikipedia. The tag claims that it should be speedily deleted because Category:Images of kitchenware has been empty for at least four days, and its only content has been links to parent categories. (CSD C1).

To contest the tagging and request that administrators wait before possibly deleting Category:Images of kitchenware, please affix the template {{hangon}} to the page, and put a note on its talk page. If the article has already been deleted, see the advice and instructions at WP:WMD. Feel free to contact the bot operator if you have any questions about this or any problems with this bot, bearing in mind that this bot is only informing you of the nomination for speedy deletion; it does not perform any nominations or deletions itself. --Android Mouse Bot 2 11:43, 20 May 2007 (UTC)[reply]

I have no objection - IIRC, some time ago I tried to organize several "images of ..." categories, and in particular there was a request for organizing pictures into an appropriate category of that type, but these seem to have disappeared... — MFH:Talk 20:56, 28 February 2008 (UTC)[reply]

Twin, sexy and related primes

I have added a section about conjectured prime gap densities to Polignac's conjecture‎. I'm not sure it's good for an article about a specific prime gap to discuss the conjectured density of other prime gaps. But I plan to add the conjectured densities of the forms themselves to cousin prime and sexy prime.

The meaning of terms in Wikipedia should be based on reliable sources and not on what seems more reasonable based on the personal views of the editors. The MathWorld reference in sexy prime says "There is only a single sexy quintuplet, (5, 11, 17, 23, 29)". I haven't seen another definition, but I can understand why you would like it. The MathWorld definition gives a single trivial quintuplet and is not equivalent to the normal definition of a prime k-tuplet which is k primes as closely together as admissible when considering potential prime factors. But I'm not sure how that should be "translated" to sexy primes when being a sexy prime is dependent on another number being prime. Maybe a sexy quintuplet should be 5 primes of 6 numbers in an arithmetic progression (p, p+6, p+12, p+18, p+24, p+30). But if p+6 or p+24 is composite then such a "sexy quintuplet" can contain a prime which is not a sexy prime. For example (41, 47, 53, 59, 71) where 65 is composite and 71 is not a sexy prime. An alternative definition would be something like: A sexy prime k-tuplet is k primes of form p+6n which are all part of a sexy prime pair with at least one of the others, and are as closely together as admissible for k such primes. But that's complicated and not fully equivalent to prime k-tuplets. Sexy prime quadruplets are rarely studied (I'm one of few people who have searched them and found the largest known), so I guess nobody has seriously considered an extended definition (before us now!). Wikipedia shouldn't make one up. PrimeHunter (talk) 02:03, 8 April 2008 (UTC)[reply]

If you removed the "sexy prime quintuplet" name from sexy prime but kept the note that (5,11,17,23,29) is the only occurrence of that pattern then I wouldn't object. I sometimes contact Eric about errors and suggested additions of published material, but generally not about other content issues like unsourced definitions, and I'm not sure what I would suggest as alternative definition. There is no clear choice and I haven't heard of anybody studying "sexy" patterns with more than 4 primes. But if you want to suggest something to Eric then go ahead. PrimeHunter (talk) 21:10, 8 April 2008 (UTC)[reply]

I did a little original research (unsuited for Wikipedia). The closest admissible patterns of 14 primes with same value modulo 6 have difference 102 between start and end. An example of one of the patterns with 20-digit primes:

97234709270276941661 + 6n for n = 0, 1, 2, 3, 5, 6, 7, 8, 10, 12, 13, 15, 16, 17.

It contains two sexy quadruplets, a non-sexy prime, a sexy pair, and a sexy triplet. These subpatterns are each separated by one composite. PrimeHunter (talk) 12:49, 9 April 2008 (UTC)[reply]

More original research. The first case of 4 sexy prime quadruplets as closely together as admissible (might be called a "sexy prime quadruplet quadruplet") is:

2327074306453592351 + n for n = 0,6,12,18, 50,56,62,68, 90,96,102,108, 120,126,132,138 (n = 110 gives a non-sexy prime). The second quadruplet has another value modulo 6. PrimeHunter (talk) 00:56, 15 April 2008 (UTC)[reply]

I used my own unpublished C program which uses the GNU Multi-Precision Library for probable prime testing. It has set a lot of records for different prime patterns since 2003. I got cpu time for the above result after finding the largest known 15-tuplet a couple of days ago after a long search. PrimeHunter (talk) 15:06, 16 April 2008 (UTC)[reply]

Prime Curios! is now listing it at http://primes.utm.edu/curios/page.php/2327074306453592351.html. I emailed you 17 April but don't know whether it got through. The mail had a link to a page which has since moved to http://primes.utm.edu/curios/includes/puzzio.php. PrimeHunter (talk) 22:23, 27 April 2008 (UTC)[reply]

Aitken method

Hi,

It appears that you've added a section on the Aitken method to Series acceleration, however, that section has an error in the formula, as noted on the talk page. Could you fix this? Thanks. linas (talk) 03:39, 2 June 2008 (UTC)[reply]

I see that Loisel made a bit of a mess with his merging and moving about; thanks for fixing that up. linas (talk) 17:06, 2 June 2008 (UTC)[reply]

I resurrected the old series acceleration, (appearently I'd written it long ago, and forgotten about it). It had been made a redirect when its contents was merged into sequence transformations. I moved much of the content (back to) there. I think that improves things, although clearly much more could be done. linas (talk) 18:35, 2 June 2008 (UTC)[reply]

RfD nomination of Vanity page

Unreferenced BLPs

Hello MFH! Thank you for your contributions. I am a bot alerting you that 2 of the articles that you created are tagged as Unreferenced Biographies of Living Persons. The biographies of living persons policy requires that all personal or potentially controversial information be sourced. In addition, to insure verifiability, all biographies should be based on reliable sources. if you were to bring these articles up to standards, it would greatly help us with the current 87 article backlog. Once the articles are adequately referenced, please remove the {{unreferencedBLP}} tag. Here is the list:

Eugène Cremmer - Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL
Bernard Julia - Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Thanks!--DASHBot (talk) 19:19, 8 January 2010 (UTC)[reply]

Articles for deletion nomination of Branch (graph theory)

I have nominated Branch (graph theory), an article that you created, for deletion. I do not think that this article satisfies Wikipedia's criteria for inclusion, and have explained why at Wikipedia:Articles for deletion/Branch (graph theory). Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time.

Please contact me if you're unsure why you received this message. RDBury (talk) 19:01, 28 January 2010 (UTC)[reply]

"Tensor notation" on "Talk:Hooke's law

I annotated one of your contribs (and another editor's that follows it) with

The following contrib was positioned at the left margin. Perhaps a colleague will offer an opinion of what earlier contrib it should be construed as commenting on.

Perhaps you'll consider either

indenting your contrib one level further than what you responded to, or
moving it into a new section.

(Or, if you believe your contrib is importantly related to the rest of the "Tensor notation" section's discussion, without being a response to anything in it, perhaps you'll consider starting a new subsection -- which i'll call "C" -- with that content, adding a section or sub-section heading, and perhaps adjusting the level of the "Tensor notation" heading, so that we end up with

== A ==

=== B ===

Other current content of "Tensor notation"

=== C ===

Your contrib current under "Tensor notation"

where either A or B is "Tensor notation", and you would come up with the titles for C and for whichever of A and B you don't designate as "Tensor notation". (Tho of course your priorities may appropriately lie elsewhere!)
--Jerzy•t 19:15, 10 March 2010 (UTC)[reply]

Articles for deletion nomination of Eugène Cremmer

I have nominated Eugène Cremmer, an article that you created, for deletion. I do not think that this article satisfies Wikipedia's criteria for inclusion, and have explained why at Wikipedia:Articles for deletion/Eugène Cremmer. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time.

Please contact me if you're unsure why you received this message. RedBlue82 ^talk 22:01, 2 September 2010 (UTC)[reply]

Sorry for not noticing the tag that had been added over 1 year... I added a liste of references according to google, and explicitely the one referred to in the text. This remains a stub, but "does not cite its sources" is no more true, and fortunately the vote was clearly to "keep". — MFH:Talk 13:55, 8 September 2010 (UTC)[reply]

Hi, Suslin cardinal includes Suslin line as a 'see also'. I have never come across any connection between them, but in case you know some way in which they are related, could you elaborate? I was planning to remove that link otherwise. Googling yielded no connection. Thanks. Chimpionspeak (talk) 16:15, 23 March 2011 (UTC)[reply]

answered on your talk page — MFH:Talk 04:23, 24 March 2011 (UTC)[reply]

Minus sign

Right, this sign is not U+002D. But U+2212 MINUS SIGN neither is a U+2013 en dash. It is true, although Google finds a lot of morons' gibberish that HTML does not possess "−", recommendations to use dashes etc. You can learn to distinguish such characters even without exploring their UCS code points, for example by copying and pasting a character to a string of several identical characters where they have different appearances.

Infix	String	Character
q-p	-----	U+002D Hyphen-minus
q–p	–––––	U+2013 en dash
q—p	—————	U+2014 em dash
q−p	−−−−−	U+2212 minus sign

Unlikely that you will be surprised today by aforementioned discoveries, but this[1] your edit initiated a confusion which lasted for more than 6 years. Not all editors have an experience to distinguish minuses from dashes. Could you remember, in which else article did you put such easter eggs? Or, maybe, you just imitated some early editor?

Note: I am aware of existence of User talk:MFH/wiki and so, but nevertheless put my message here for a better visibility.
Incnis Mrsi (talk) 11:30, 12 January 2012 (UTC)[reply]

Maxwell's equations#Conceptual insight from this formulation

Greetings, MFH!

Your edit has existed peacefully for 6 years in Maxwell's equations. The article is evolving. When I was reading it this morning, I was quite alarmed to see that I no longer understood your contribution, based on the flow of the article as it now stands. Specifically, I can no longer understand the 'interaction term A J' expression.

Since the changes to the Maxwell's equations article are moving the searchlight to your contribution, I hope that you will amplify your long standing edit. Regards, --Ancheta Wis (talk | contribs) 10:31, 31 March 2012 (UTC)[reply]

Disambiguation link notification for November 12

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Space–time tradeoff, you added a link pointing to the disambiguation page Brute force (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article 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) 11:51, 12 November 2012 (UTC)[reply]

Dear Bot, in this case the DAB page was exactly what I wanted to link to. Please consider the possibility that I have checked and evaluated the different possible choices and made what seemed to me the best choice available. If you don't know better, you should not assume that s/o did not want to do what he did, in particular not w/o taking into account the user profile, number of contributions and seniority. — MFH:Talk 13:04, 12 November 2012 (UTC)[reply]

Article Feedback deployment

Hey MFH; I'm dropping you this note because you've used the article feedback tool in the last month or so. On Thursday and Friday the tool will be down for a major deployment; it should be up by Saturday, failing anything going wrong, and by Monday if something does :). Thanks, Okeyes (WMF) (talk) 21:25, 13 March 2013 (UTC)[reply]

Image without license

Unspecified source/license for File:Plot of number of primes between consecutive squares.png

Thanks for uploading File:Plot of number of primes between consecutive squares.png. The image has been identified as not specifying the copyright status of the image, which is required by Wikipedia's policy on images. Even if you created the image yourself, you still need to release it so Wikipedia can use it. If you don't indicate the copyright status of the image on the image's description page, using an appropriate copyright tag, it may be deleted some time in the next seven days. If you made this image yourself, you can use copyright tags like {{PD-self}} (to release all rights), {{self|CC-by-sa-3.0|GFDL}} (to require that you be credited), or any tag here - just go to the image, click edit, and add one of those. If you have uploaded other images, please verify that you have provided copyright information for them as well.

For more information on using images, see the following pages:

This is an automated notice by MifterBot. For assistance on the image use policy, see Wikipedia:Media copyright questions. NOTE: once you correct this, please remove the tag from the image's page. --MifterBot ^{(Talk • Contribs • Owner)} 01:34, 20 May 2013 (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) 12:56, 23 November 2015 (UTC)[reply]

Weird number

Hey there, I hope you are doing well.I am just curious about the weird number talk and the following is written there:

"What's the point in the quoted result from the 1976 paper concerning very large weird numbers, given that if N is weird, Np is weird for all p>sigma(N) ? So taking p=M#44 (the largest known prime), we get a much larger weird number using any other weird number (provided its divisors' sum does not exceed M#44). — MFH:Talk 17:47, 4 April 2008 (UTC)

I haven't seen the paper, but I would guess the point was to construct a large primitive weird, ie one which has no weird factor (and therefore no abundant factor). Hv (talk) 08:00, 30 June 2012 (UTC)"

So what i wanted to know is that can you show me the proof of the statement Np is weird i am trying to look really hard into it but i cannot seem to find it even in the paper.I really appreciate your help thanks. Sarim. — Preceding unsigned comment added by 39.63.36.72 (talk) 15:50, 7 December 2015 (UTC)[reply]

I should answer on your talk page but you connected anonymously. If p > sigma(N) then the divisors of Np, DIV(Np) are the divisors of N union these divisors times p : D(Np) = D(N) U p*D(N). Since N is not a sum of some of its divisors, Np cannot be either (because even adding all of N's divisors up is less than p, the smallest "step" possible in between multiples of p): Let X(N) be the set of numbers which are sum of a subset of D(N), then X(Np) = X(N) + p*X(N) (I think... maybe there's a typo here...?). Since N is not in X(N), Np is not in X(Np). - — MFH:Talk 20:55, 8 December 2015 (UTC)[reply]

ArbCom Elections 2016: Voting now open!

Hello, MFH. 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. Mdann52 (talk) 22:08, 21 November 2016 (UTC)[reply]

Little group listed at Redirects for discussion

An editor has asked for a discussion to address the redirect Little group. Since you had some involvement with the Little group redirect, you might want to participate in the redirect discussion if you have not already done so. Mabalu (talk) 10:32, 23 February 2017 (UTC)[reply]

Tela (disambiguation)

I removed the following material from Tela (disambiguation):

==Computer software==

* Tela<ref>http://www.ava.fmi.fi/prog/tela.html Tela</ref> is a [[software package]] similar to [[Matlab]] and [[GNU Octave|(GNU) Octave]], but designed specifically for [[tensor calculus]].

==References==

Entries can not be included on a disambiguation page unless they merit inclusion elsewhere in the encyclopedia. Also, entries that are included pursuant to WP:DABMENTION must be discussed in the linked articles. Reference sections are not used on disambiguation pages, nor are external links permitted on disambiguation pages, to avoid spam. If you believe this software package merits inclusion in the encyclopedia, please create a separate draft for it, or add it to a relevant non-disambiguation article. Cheers! bd2412 T 18:30, 1 July 2017 (UTC)[reply]

ArbCom 2017 election voter message

Hello, MFH. 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, MFH. 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]

September 2019

Speedy deletion nomination of John Scholes (mathematician)

If this is the first article that you have created, you may want to read the guide to writing your first article.
You may want to consider using the Article Wizard to help you create articles.

A tag has been placed on John Scholes (mathematician) requesting that it be speedily deleted from Wikipedia. This has been done under section G12 of the criteria for speedy deletion, because the page appears to be an unambiguous copyright infringement. This page appears to be a direct copy from https://www.amazon.co.uk/Discover-Maths-Induction-John-Scholes/dp/1484922182. For legal reasons, we cannot accept copyrighted text or images taken from other web sites or printed material, and as a consequence, your addition will most likely be deleted. You may use external websites or other printed material as a source of information, but not as a source of sentences. This part is crucial: say it in your own words. Wikipedia takes copyright violations very seriously and persistent violators will be blocked from editing.

If the external website or image belongs to you, and you want to allow Wikipedia to use the text or image — which means allowing other people to use it for any reason — then you must verify that externally by one of the processes explained at Wikipedia:Donating copyrighted materials. The same holds if you are not the owner but have their permission. If you are not the owner and do not have permission, see Wikipedia:Requesting copyright permission for how you may obtain it. You might want to look at Wikipedia's copyright policy for more details, or ask a question here.

If you think this page should not be deleted for this reason, you may contest the nomination by visiting the page and clicking the button labelled "Contest this speedy deletion". This will give you the opportunity to explain why you believe the page should not be deleted. However, be aware that once a page is tagged for speedy deletion, it may be deleted without delay. Please do not remove the speedy deletion tag from the page yourself, but do not hesitate to add information in line with Wikipedia's policies and guidelines.

John Scholes (mathematician) moved to draftspace

An article you recently created, John Scholes (mathematician), does not have enough sources and citations as written to remain published. It needs more citations from reliable, independent sources. (?) Information that can't be referenced should be removed (verifiability is of central importance on Wikipedia). I've moved your page to draft space (with a prefix of Draft: before the article title) where you can work on it with minimal disruption. When you feel that it meets our notability and neutrality requirements, and is thus ready for mainspace, please submit it using the Articles for Creation template on the page. Justlettersandnumbers (talk) 22:42, 15 September 2019 (UTC)[reply]

John Scholes (software engineer)

Thanks for the heads-up. I worked with the John Scholes in question between 2008-2019. I believe the following; if I am wrong please refer me to sources which show that I am wrong.

He did not contribute problems the Math Olympiad or the Putnam competition.
He did not write a book on C++.
He did not write the two "Discover Maths" books.

-- Roger Hui (talk) 03:50, 16 September 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]

Draft:John Scholes (software engineer) concern

Hi there, I'm HasteurBot. I just wanted to let you know that Draft:John Scholes (software engineer), a page you created, has not been edited in 5 months. The Articles for Creation space is not an indefinite storage location for content that is not appropriate for articlespace.

If your submission is not edited soon, it could be nominated for deletion. If you would like to attempt to save it, you will need to improve it.

You may request Userfication of the content if it meets requirements.

If the deletion has already occured, instructions on how you may be able to retrieve it are available at WP:REFUND/G13.

Thank you for your attention. HasteurBot (talk) 01:24, 13 March 2020 (UTC)[reply]

Your draft article, Draft:John Scholes (software engineer)

Hello, MFH. It has been over six months since you last edited the Articles for Creation submission or Draft page you started, "John Scholes".

In accordance with our policy that Wikipedia is not for the indefinite hosting of material deemed unsuitable for the encyclopedia mainspace, the draft has been nominated for deletion. If you plan on working on it further, or editing it to address the issues raised if it was declined, simply edit the submission and remove the {{db-afc}}, {{db-draft}}, or {{db-g13}} code.

If your submission has already been deleted by the time you get there, and you wish to retrieve it, you can request its undeletion by following the instructions at this link. An administrator will, in most cases, restore the submission so you can continue to work on it.

Thank you for your submission to Wikipedia! CptViraj (📧) 16:03, 11 April 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:20, 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:07, 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]

Phanboi8x9x

ae1f961be40735243e91a500a0b669f2 2401:D800:F8F1:3B5E:0:2:66FB:D601 (talk) 19:30, 13 January 2024 (UTC)[reply]

Finally somebody who understands me! ❤️ — MFH:Talk 04:17, 14 January 2024 (UTC)[reply]

ArbCom 2024 Elections voter message

Hello! Voting in the 2024 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 2 December 2024. 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 2024 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, 19 November 2024 (UTC)[reply]