text:
New Hampshire Route 25

New Hampshire Route 25 is a 96.62 mi long east–west state highway in New Hampshire. It runs completely across the state from Vermont to Maine.

The western terminus of Route 25 is at the Vermont state line on the Connecticut River in Piermont, where the road continues west as Vermont Route 25. The eastern terminus is on the Maine state line in the town of Freedom, where the road continues east as Maine State Route 25.

Route description
New Hampshire Route 25 begins at the state border, on the western bank of the Connecticut River, where it continues west as VT 25. It crosses the river on a metal truss bridge and enters the town of Piermont. Upon reaching Four Corners near the center of Piermont, NH 25 turns north to form a concurrency with NH 10, while the roadway continues east through the intersection as NH 25C, a more direct but rugged route to the town of Warren. Heading north along with NH 10 parallel to the Connecticut River, NH 25 is known locally as Dartmouth College Highway. Upon entering the town of Haverhill, in Haverhill Village, NH 25 leaves the concurrency along Mount Moosilauke Highway, paralleling Oliverian Brook.

Upon leaving Haverhill Village, NH 25 passes through the communities of Pike and East Haverhill, the location of the Oliverian School, before entering the town of Benton. NH 25 crosses the southwestern corner of Benton, but lacks any road connection to the rest of the town. To the northeast of the road sits the western end of the White Mountain chain, with Mount Moosilauke rising prominently. The road bends to the south and enters the town of Warren in the village of Glencliff. Winding southwards, the route merges with Route 118 to pass through the main village of Warren. The two conjoined routes parallel the Baker River, crossing it several times before entering Wentworth.

In Wentworth, NH 25/NH 118 meets the eastern terminus of NH 25A, which connects to the towns of Orford, New Hampshire, and Fairlee, Vermont. Turning gently towards the southeast, NH 25/NH 118 passes by the Plummer's Ledge Natural Area and enters the town of Rumney. NH 118 leaves to the southwest upon entering Rumney, and NH 25 continues southeastward, passing the villages of West Rumney, Rumney Depot, and Quincy. Nearby attractions include Rumney Rocks, a popular rock climbing venue, and Polar Caves Park, a series of glacial caves. Still following the Baker River, NH 25 enters the town of Plymouth, meeting NH 3A at a traffic circle in the village of West Plymouth. 3A merges from the south and the two routes head east along Tenney Mountain Highway. At the northern edge of Plymouth Village, there is a brief freeway interchange where NH 25 east merges with US 3 south, while the roadway continues on a short while before merging with an interchange on I-93 (exit 26). The interchange marks the northern end of NH 3A.

Now cosigned with US 3, NH 25 heads south along the western bank of the Pemigewasset River through Plymouth Village along Main Street, passing Plymouth State University and by a commercial district south of the university campus at the town common. In the center of the university campus there is an intersection with NH 175A, a short connector bridging the Pemigewasset and providing access to I-93 (exit 25) and NH 175. After leaving Plymouth Village, NH 25 and US 3 travel through a more rural area of Plymouth before crossing the extreme northern corner of the town of Bridgewater. After crossing the Pemigewasset into Ashland, there is an interchange with I-93 (Exit 24) and the conjoined routes turn east into Ashland Village along Daniel Webster Highway, intersect NH 132 at Main Street and Highland Street, and turn north along the western shore of Little Squam Lake.

Entering the town of Holderness, there is an intersection with the southern end of NH 175 and the road curves to the east to follow the shore of Little Squam Lake. Passing between Little Squam Lake and Squam Lake, the two routes meet the southern terminus of NH 113 and pass by the main village of Holderness and the Squam Lakes Natural Science Center. After curving to the southeast, the routes pass through the village of East Holderness and pass into the town of Center Harbor. Shortly after entering town, NH 25/US 3 turns to a more southerly direction, while NH 25B has its western terminus. NH 25B provides a much more direct route for travellers continuing on NH 25, as the main route loops southward into the town of Meredith. In Meredith Village, at the tip of Meredith Bay on Lake Winnipesaukee, NH 25 leaves its long concurrency with US 3, turning sharply to the northeast along Main Street/Whittier Highway. Passing Inter-Lakes Middle High School, NH 25 turns northward when it meets the shores of Lake Winnipesaukee main axis, known as The Broads, and passes into Center Harbor a second time.

After re-entering Center Harbor, NH 25 meets the eastern end of NH 25B at the central business district of Center Harbor at the northern tip of the main axis of Lake Winnipesaukee, and heads east into Moultonborough. Passing by a number of the smaller lakes that give New Hampshire's Lakes Region its name, NH 25 travels northeast, having a brief concurrency with NH 109 in Moultonborough Village, turns northwards and passes Moultonborough Airport, then passes through the East Sandwich portion of the town of Sandwich. Turning to the east, NH 25 next enters the town of Tamworth, merging with NH 113 at Bennett Corners. The two routes run concurrently eastwards along the south bank of the Bearcamp River into the village of Whittier, where NH 113 leaves to the north. Within Tamworth, NH 25 is known as Bearcamp Highway. Bending to the southeast, NH 25 enters Ossipee.

In West Ossipee, NH 25 (now known as Ossipee Mountain Highway) passes near the historic Whittier Bridge before crossing over the Bearcamp River and coming to a T-intersection with NH 16 and joining it southbound along White Mountain Highway. Heading southeast past the western shore of Ossipee Lake, there are two intersections with NH 16B before NH 25 leaves White Mountain Highway to the northeast at an interchange in Center Ossipee. Passing through the Ossipee Lake Natural Area south of Ossipee Lake, NH 25 crosses into Effingham, passing through the village of Effingham Falls along a brief concurrency with NH 153, then crossing the Ossipee River into the town of Freedom, New Hampshire. Now following the northern bank of the Ossipee River, NH 25 reaches its eastern terminus at the Maine border, with the roadway continuing into the town of Porter, Maine, as Maine Route 25.

History
In the 1920s, NH 25 was part of New England Interstate Route 25, a route in the New England Interstate Highway system.

New Hampshire Route 25A
New Hampshire Route 25A is a 15.117 mi long east–west state highway in New Hampshire connecting Wentworth and Orford. It runs through a scenic, mountainous area of western New Hampshire.

The western terminus of NH 25A is at the Vermont state line on the Connecticut River in the town of Orford, where the route continues west as the short Vermont Route 25A. 150 yd from the state line, VT 25A ends at U.S. Route 5 in Fairlee. The eastern terminus of NH 25A is in the town of Wentworth at New Hampshire Route 25 and New Hampshire Route 118.

In 2002, the state designated most of NH 25A as the Governor Meldrim Thomson Scenic Highway. The highway runs from Wentworth to the junction with New Hampshire Route 10 in Orford. The road was named in honor of the late Gov. Meldrim Thomson, Jr., who died April 19, 2001. Thomson's Mt. Cube Farm lined both sides of the highway.

New Hampshire Route 25B
New Hampshire Route 25B (abbreviated NH 25B) is a 3.246 mi east–west state highway in New Hampshire. It runs through the town of Center Harbor in the state's Lakes Region.

The eastern terminus is in Center Harbor at New Hampshire Route 25. The western terminus is in Center Harbor at U.S. Route 3 and New Hampshire Route 25. The entire length of road is known as Dane Road and as Plymouth Street.

New Hampshire Route 25C
New Hampshire Route 25C (abbreviated NH 25C) is a 13.218 mi east–west state highway in New Hampshire. It runs through the scenic, mountainous area connecting Warren and Piermont. While more direct than the main routing of NH 25, shortening the length between its end points by several miles, the terrain is also more rugged.

The western terminus of NH 25C is in Piermont at New Hampshire Route 10 and New Hampshire Route 25. The eastern terminus is in Warren at NH 25 and New Hampshire Route 118. The entire length of highway is known as Lake Tarleton Road.

title: New Hampshire Route 25


text:
Mediterranean Revival architecture

Mediterranean Revival is an architectural style introduced in the United States, Canada, and certain other countries in the 19th century. It incorporated references from Spanish Renaissance, Spanish Colonial, Italian Renaissance, French Colonial, Beaux-Arts, Moorish architecture, and Venetian Gothic architecture.

Peaking in popularity during the 1920s and 1930s, the movement drew heavily on the style of palaces and seaside villas and applied them to the rapidly expanding coastal resorts of Florida and California.

Structures are typically based on a rectangular floor plan, and feature massive, symmetrical primary façades. Stuccoed walls, red tiled roofs, windows in the shape of arches or circles, one or two stories, wood or wrought iron balconies with window grilles, and articulated door surrounds are characteristic. Keystones were occasionally employed. Ornamentation may be simple or dramatic. Lush gardens often appear.

The style was most commonly applied to hotels, apartment buildings, commercial structures, and residences. Architects August Geiger and Addison Mizner were foremost in Florida, while Bertram Goodhue, Sumner Spaulding, and Paul Williams were in California.

There are also examples of this architectural style in Cuba, such as the Hotel Nacional de Cuba, in Havana.

Examples

 * AdventHealth Celebration, Celebration, Florida, opened in 1997
 * Allouez Pump House in Allouez, Wisconsin, 1925
 * Ambassador Hotel in Los Angeles, California, 1921 (demolished)
 * Beverly Hills City Hall, Beverly Hills, California, 1932
 * Beverly Shores Railroad Station, 1928
 * Boca Raton Resort & Club in Boca Raton, Florida, completed in 1926
 * Cà d'Zan, former John Ringling estate in Sarasota, Florida, completed in 1926
 * Casa Casuarina (Versace Mansion, now known as The Villa By Barton G.) in Miami Beach, Florida, 1930
 * Catalina Casino in Avalon, California, completed May 29, 1929
 * Cooley High School, Detroit, Michigan, built in 1928
 * Plymouth County Hospital, a tuberculosis sanatorium in Hanson, Massachusetts. Completed in 1919
 * Delaware and Hudson Passenger Station in Lake George, New York, 1909–1911
 * Don CeSar Hotel, St. Pete Beach, Florida, completed in 1928
 * E. W. Marland Mansion in Ponca City, Oklahoma, completed in 1928
 * The Church of Scientology's Flag Building, Clearwater, Florida, completed in 2011
 * Florida Theatre in Jacksonville, Florida, completed in 1927
 * Fort Harrison Hotel in Clearwater, Florida, completed in 1926
 * Francis Marion Stokes Fourplex in Portland, Oregon, completed in 1926
 * Freedom Tower in Miami, Florida, completed in 1925
 * Santa Fe Railway depot in Fullerton, California, completed 1930
 * Gaia Apartment Building in Berkeley, California, 2001
 * Greenacres (former Harold Lloyd Estate) in Beverly Hills, California, completed in 1928
 * Harder Hall Hotel, Sebring, Florida, completed in 1928
 * Hayes Mansion in San Jose, California, completed in 1905
 * L. Ron Hubbard House, Washington, D.C., built in 1904
 * Miami-Biltmore Hotel in Coral Gables, Florida, completed in 1926
 * Natural History Museum of Los Angeles County in Los Angeles, California, 1913
 * Nottingham Cooperative, 1927, Madison, Wisconsin
 * Pasadena City Hall in Pasadena, California, 1927
 * Port Washington Fire Engine House in Wisconsin, completed in 1929
 * Presidio building in San Francisco, California, completed in 1912
 * Rose Crest Mansion (Currently a portion of The Mary Louis Academy) in Jamaica Estates, New York, completed in 1909
 * Snell Arcade in St. Petersburg, Florida. 1925
 * Stuart Court Apartments, Richmond, Virginia, completed in 1926
 * Sunrise Theatre, Fort Pierce, Florida, built in 1922
 * The Twilight Zone Tower of Terror in Walt Disney World, Orlando, Florida. 1994
 * Town Club (Portland, Oregon), completed 1931
 * Villa Vizcaya in Miami, Florida, completed in 1914
 * Vinoy Park Hotel in St. Petersburg, Florida, completed in 1925
 * Wolfsonian-FIU, in Miami Beach, Florida, 1927

General and cited references

 * Nolan, David (1995). The Houses of St. Augustine. Sarasota, Pineapple Press.
 * Nolan, David (1995). The Houses of St. Augustine. Sarasota, Pineapple Press.
 * Nolan, David (1995). The Houses of St. Augustine. Sarasota, Pineapple Press.

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: Mediterranean Revival architecture


text:
User:Sietske~enwiki

Sietske (25 going on 26) lives in Lemmer (The Netherlands) and kicks ass!

title: User:Sietske~enwiki


text:
Caras

Caras may refer to:

 * Caras (magazine), a Portugal-based women's magazine
 * Caraș River, a river in Serbia and Romania
 * Caras (tribe), an indigenous tribe living in coastal Ecuador (1-1000 CE)
 * Carás, an alternate spelling of Caraz (mountain), in the Peruvian Andes
 * Canadian Academy of Recording Arts and Sciences, an organization for promoting and celebrating Canadian music and artists and which conducts the Juno Awards

People with the surname Caras

 * Cien Caras (born 1949), ring name of Mexican professional wrestler Carmelo Reyes González
 * Dos Caras (born 1951), ring name of Mexican professional wrestler José Luis Rodríguez
 * Dos Caras, Jr. (born 1977), ring name of Rodríguez's son, Mexican professional wrestler and mixed martial arts fighter Alberto Rodríguez, also known as Alberto Del Rio
 * Emil Caras (born 1967), Moldovan association football coach and a former player
 * Ion Caras (born 1950), Moldovan association football manager
 * Peter Caras (born 1941), American illustrator
 * Roger A. Caras (1928–2001), American animal photographer/writer and wildlife preservationist

title: Caras


text:
User:BOfH

Hello, resident Bastard Operator from Hell here.

title: User:BOfH


text:
The Flies

The Flies (Les Mouches) is a play by Jean-Paul Sartre, produced in 1943. It is an adaptation of the Electra myth, previously used by the Greek playwrights Sophocles, Aeschylus and Euripides. The play recounts the story of Orestes and his sister Electra in their quest to avenge the death of their father Agamemnon, king of Argos, by killing their mother Clytemnestra and her husband Aegisthus, who had deposed and killed him.

Sartre incorporates an existentialist theme into the play, having Electra and Orestes engaged in a battle with Zeus and his Furies, who are the gods of Argos and the centerpiece for self-abnegating religious rituals. This results in fear and a lack of autonomy for Zeus's worshippers, who live in constant shame of their humanity.

Act 1
Orestes first arrives as a traveler with his tutor/slave, and does not seek involvement. Orestes has been traveling in a quest to find himself. He enters the story more as an adolescent with a girlish face, one who does not know his path or responsibility. He enters the city and introduces himself as Philebus ("lover of youth"), to disguise his true identity. Zeus has followed Orestes on his journey, and finally approaches him in Argos, introducing himself as Demetrios ("devoted to Demeter", a goddess who was in fact Zeus' own sister). Orestes has come on the eve of the day of the dead, a day of mourning to commemorate the killing of Agamemnon fifteen years prior. No townsperson aside from an aphasic "idiot boy" will speak to Orestes or his tutor because they are strangers and not mourning, remorseful or dressed in all black. Orestes meets his sister, Electra, and sees the terrible state that both she and the city are in. Electra has been treated as a servant girl since her mother and Aegisthus killed her father. She longs to exact her revenge and refuses to mourn for the sins and death of Agamemnon or of the townspeople.

Act 2
Orestes goes to the ceremony of the dead, where the angry souls are released by Aegisthus for one day where they are allowed out to roam the town and torment those who have wronged them. The townspeople have to welcome the souls by setting a place at their tables and welcoming them into their beds. The townspeople have seen their purpose in life as constantly mourning and being remorseful of their "sins". Electra, late to the ceremony, dances on top the cave in a white gown to symbolize her youth and innocence. She dances and yells to announce her freedom and denounce the expectation to mourn for deaths not her own. The townspeople begin to believe and think of freedom until Zeus sends a contrary sign to deter them, and to deter Orestes from confronting the present King.

Orestes and Electra unite and eventually resolve to kill Aegisthus and Clytemnestra. Zeus visits Aegisthus to tell him of Orestes's plan and convince him to stop it. Here Zeus reveals two secrets of the gods: 1) people are free and 2) once they are free and realize it, the gods cannot touch them. It then becomes a matter between men. The ceremony of the dead and its fable has enabled Aegisthus to keep control and order over the town, instilled fear among them. Aegisthus refuses to fight back when Orestes and Electra confront him. Orestes kills Aegisthus and then he alone goes to Clytemnestra's bed chamber and kills her as well.

Act 3
Orestes and Electra flee to the temple of Apollo to escape men and the flies. At the temple, the furies wait for Orestes and Electra to leave the sanctuary so the furies can attack and torture them. Electra fears her brother and begins to try to avoid her responsibility for the murders. She attempts to evade guilt and remorse by claiming she had only dreamt of murder for 15 years, as a form of release, while Orestes is the actual murderer. Orestes tries to keep her from listening to the Furies - which are convincing her to repent and accept punishment.

Zeus attempts to convince Orestes to atone for his crime, but Orestes says he cannot atone for something that is not a crime. Zeus tells Electra he has come to save them and will gladly forgive and give the throne to the siblings, if they repent. Orestes refuses the throne and belongings of the man he killed. Orestes feels he has saved the city by removing the veil from their eyes and exposing them to freedom. Zeus says the townspeople hate him and are waiting to kill him; he is alone. The scene at the temple of Apollo represents a decision between God's law and self-law (autonomy). Zeus points out that Orestes is foreign even to himself. Sartre demonstrates Orestes' authenticity by stating that, since his past does not determine his future, Orestes has no set identity: he freely creates his identity anew at every moment. He can never know who he is with certainty because his identity changes from moment to moment.

Orestes still refuses to repudiate his actions. In response, Zeus tells Orestes of how he himself has ordered the universe and nature based on Goodness, and by rejecting this Goodness, Orestes has rejected the universe itself. Orestes accepts his exile from nature and from the rest of humanity. Orestes argues Zeus is not the king of man and blundered when he gave them freedom - at that point they ceased to be under god's power. Orestes announces he will free the townspeople from their remorse and take on all their guilt and "sin" (author makes reference to Jesus Christ). Here Orestes somewhat illustrates Nietzsche's overman by showing the townspeople his power to overcome pity. Electra chases after Zeus and promises him her repentance.

When Electra repudiates her crime, Orestes says that she is bringing guilt on herself. Guilt results from the failure to accept responsibility for one's actions as a product of one's freedom. To repudiate one's actions is to agree that it was wrong to take those actions in the first place. In doing this, Electra repudiates her ability to freely choose her own values (to Sartre, an act of bad faith). Instead, she accepts the values that Zeus imposes on her. In repudiating the murders of Clytemnestra and Aegisthus, Electra allows Zeus to determine her past for her. She surrenders her freedom by letting her past take on a meaning that she did not give to it by herself, and as a result she becomes bound to a meaning that did not come from her. Electra can choose, like Orestes, to see the murders as right and therefore to reject feelings of guilt. Instead, she allows Zeus to tell her that the murders were wrong and to implicate her in a crime.

The Furies decide to leave her alone in order to wait for Orestes to weaken so they can attack him. The Tutor enters but the Furies will not let him through. Orestes orders him to open the door so that he may address his people. Orestes informs them he has taken their crimes upon himself and that they must learn to build a new life for themselves without remorse. He wishes to be a king without a kingdom, and promises to leave, taking their sins, their dead, and their flies with him. Telling the story of the pied piper, Orestes walks off into the light as the Furies chase after him.

Characters
Zeus (Greek) / Jupiter (Roman) – a major antagonist in the play, Zeus is introduced in the exposition as "god of flies and death", although he is traditionally associated with sky, lightning, thunder, law, order, and justice.

Orestes (Philebus) – the play's major protagonist, he is the brother of Electra and the son of Agamemnon.

Electra – the sister of Orestes and the daughter of Agamemnon.

Agamemnon – the former king of Argos and the father of Orestes and Electra, Agamemnon was murdered by Aegisthus prior to the story's onset. Orestes' desire to avenge his father's death is a major plot device in the play.

Clytemnestra – the wife of Aegisthus and the mother of Orestes and Electra.

Aegisthus – the husband of Clytemnestra.

Furies – also known as the Erinyes or "infernal goddesses", the Furies serve as Zeus' enforcers in Argos and punish those who swear false oaths.

Background
In 1941, Sartre and Simone de Beauvoir attended performances of a production of The Suppliant Maidens, in which Olga Kosakiewicz had a part.
 * "It was during this production of The Suppliant Maidens that Sartre conceived the idea of writing a play himself. Both Olgas [i.e. Olga Kosakiewicz and another woman named Olga] had parts in it . . . .  During rehearsals they asked [the play's producer-director Jean-Louis Barrault] how to go about getting a really first-rate part. 'The best way,' he replied, 'would be to get someone to write a play for you.' And Sartre thought: 'Why shouldn't I be the one?'  He had written and produced a play in the Stalag, called Bariona: ostensibly the theme of this 'mystery play' was the birth of Christ, but in fact the drama centered on the Roman occupation of Palestine, and his fellow prisoners were quick to take the allusion. What they applauded on Christmas Eve was Resistance propaganda. The real function of the theater, Sartre thought at the time, is to appeal to those who share a common predicament with the playwright. This 'common predicament' was one that faced Frenchmen everywhere, assailed daily as they were by German and Vichy propaganda exhorting them to repent and submit; the theater might provide a medium through which to remind them of rebellion and freedom.  He began to cast around for a plot that would be at once technically unobjectionable and transparent and its implications."

Years later, Sartre stated: "The real drama, the drama I should have liked to write, was that of the terrorist who, by ambushing Germans, becomes the instrument for the execution of fifty hostages." Noted Sartre biographer Annie Cohen-Solal views this statement as an allusion to a series of events that occurred in occupied Paris in 1941: a German officer was killed at the Métro Barbès and in retaliation the German military forces executed eight prisoners in September and then 98 prisoners in October. However, the German censors would have banned such a play, so Sartre was forced to look for other subjects. He settled on the idea of using the story of the Atridae as a vehicle. De Beauvoir says that the first act was inspired by the town of Emborio, "the village on Santorin which had presented so sinister at atmosphere to us when we first reached it [during a holiday] -- all those blank, shuttered houses under the blazing noonday sun." She also says that she, after reading a book about the Etruscans, informed Sartre about the Etruscans' funeral ceremonies, and he found inspiration in this for the second act.

Sartre's philosophy
One scholar has explained the relationship between The Flies and Sartre's philosophy thus:
 * "The play explores the key existentialist themes of freedom and responsibility through the radical conversion of Philebus the peace loving intellectual into Orestes the warrior. A person may not be prepared for present crises by his past experiences, but it is nonetheless bad faith for him to declare, 'I was not meant for this' or 'This should not be happening to me.'  Orestes resists bad faith and achieves authenticity by rising to the demands of his circumstances and fully realizing his being-in-situation."

Sartre's idea of freedom specifically requires that the being-for-itself be neither a being-for-others nor a being-in-itself. A being-for-others occurs when human beings accept morals thrust onto them by others. A being-in-itself occurs when human beings do not separate themselves from objects of nature. Zeus represents both a moral norm, the Good, and Nature. Freedom is not the ability to physically do whatever one wants. It is the ability to mentally interpret one's own life for oneself—to define oneself and create one's own values. Even the slave can interpret his or her life in different ways, and in this sense the slave is free.

The Flies also shows the effect of Nietzsche on Sartre. Orestes represents the idea of the overman, as described in works such as Thus Spoke Zarathustra; the ability to free one's mind from dogma and the impressions of others, and instead think on a higher level. Like Zarathustra, Orestes feels he must "go down" to the people and open their eyes (though unlike Zarathustra, Orestes does it out of compassion). When debating Zeus, Orestes also talks about being "beyond" the moral yoke others allow to be placed on them - an idea explicitly discussed in Beyond Good and Evil, and implicitly described in other works by Nietzsche. Orestes is not bound by the false dichotomy of "good" and "evil," and instead accepts what has been done, choosing to focus on the present and the future.

Sartre continued a twentieth-century tradition of an incestuous flirtation between Électre and Oreste in Les Mouches. This flirtation may have been inspired by the incestuous siblings of Andre Gide’s Œdipe, and philosophically motivated by Gide and Sartre’s shared antipathy to Freud’s repression theory.

Production history
The Flies was first produced in Paris on 3 June 1943. The production ran at the Théâtre de la Cité. Sartre had to get German censors to approve the play, because Paris was occupied by the German army. A sculptor was employed to create "great blocks of stone", as well as settings, masks, and statues; large numbers of extras were also used. During one of the rehearsals, a young man came up to Sartre and introduced himself; it turned out to be Albert Camus. The production was poorly attended and got a lukewarm reception from critics. Simone de Beauvoir's assessment of the play's effectiveness and reception was as follows: "It was impossible to mistake the play's implications; the word Liberty, dropped from Orestes' mouth, burst on us like a bomb. The German critic of Pariser Zeitung saw this very clearly, and said so, though at the same time taking the credit for giving the play a favorable notice.  Michel Leiris praised The Flies in a clandestine edition of Les Lettres francaises, and emphasized its political significance.  Most reviewers pretended not to have noticed any such allusion; they pitched into the play viciously, but, so they alleged, on purely literary grounds . . . "

After a first smaller US production at Vassar College early in April 1947, the play received its New York City debut at the President Theatre on April 16, 1947. It was directed by the head of the Dramatic Workshop, German expatriate stage director Erwin Piscator. The New York Times' critic Lester Bernstein reacted favorably to the play and its production:

The Dramatic Workshop's skillful production takes this dramatic history of the play into full account by employing several theatrically effective devices, including a newsreel curtain-raiser depicting the Nazi heyday.

Compared to the Oresteia
The Flies is also a modern take on Aeschylus’ trilogy, the Oresteia. While Sartre keeps many aspects of the original story by Aeschylus, he adjusts the play to fit his views, with strong themes of freedom from psychological slavery. He focuses most on the second play in the Oresteia trilogy, only referencing the first play, Agamemnon, with the mention of Agamemnon’s death by Clytemnestra and Aegisthus. The plot of the third play, The Eumenides is also excluded because in that play, the Council of Elders absolves Orestes of his sins, but since Sartre depicts Orestes as remorseless, he cannot include that storyline in his play without having to change his storyline. Unlike in Aeschylus’ The Libation Bearers, where revenge is one of the main themes throughout the play, Sartre’s Orestes does not kill Aegisthus and Clytemnestra for vengeance or because it was his destiny, instead it is for the sake of the people of Argos, so that they may be freed from their enslavement. Sartre wants to stress the fact that Orestes comes to that decision by himself, without the aid or direction of any outside forces, which contrasts with the Orestes in The Libation Bearers, who relies heavily on the direction of the gods. Sartre even diminishes the character of Clytemnestra so that there is much less emphasis on matricide than there is in the version by Aeschylus. While Electra is guilt-stricken after the death of Clytemnestra, Orestes feels no remorse for killing his mother, so his relationship with her is not very important. Sartre’s representation of the Furies differs from that of Aeschylus in that, instead of attempting to avenge the crimes committed, they try to evoke guilt from those who committed them. Sartre does this to reiterate the importance of amenability; he wants to prove that remorse should only be felt if one believes the act committed is wrong. By acting in what he believes to be a righteous way and killing the king and queen, Orestes takes responsibility for his actions without feeling any remorse for them.

Adaptations

 * La Tragedie d'Oreste et Electre: Album by British band The Cranes (band).

title: The Flies


text:
Darryl Worley

Darryl Wade Worley (born October 31, 1964) is an American country music singer and songwriter. Signed to DreamWorks Records Nashville in 1999, Worley released four albums for the label: Hard Rain Don't Last (2000), I Miss My Friend (2002), Have You Forgotten? (2003), and Darryl Worley in 2004. After the label closed in 2005, he moved to 903 Music, an independent label owned by Neal McCoy, releasing Here and Now in 2006, shortly before that label's closure. His most recent studio release is 2009's Sounds Like Life via Stroudavarious Records, owned by James Stroud.

Worley's six albums have produced 18 singles on the Billboard Hot Country Songs charts, including three number ones: "I Miss My Friend", "Have You Forgotten?", and "Awful, Beautiful Life", from 2002, 2003 and 2004–2005, respectively. "Have You Forgotten?" spent seven weeks at number one. Nine other singles have reached the top 40.

Biography
Darryl Wade Worley was born October 31, 1964, in Memphis, Tennessee, to Tommy and Bonnie Worley. His family moved to Pyburn, Tennessee, when he was young and he was raised there. His father was a Methodist preacher and his mother sang in the church choir. Worley attended the University of North Alabama and earned a degree in biology and chemistry. He worked in the chemical industry prior to pursuing country music, and wrote for FAME Studios in Muscle Shoals, Alabama. One of his first cuts as a songwriter was a track on Archer/Park's 1994 debut album.

Hard Rain Don't Last (1999–2001)
Worley was signed to DreamWorks Records in 1999. His debut single "When You Need My Love" followed in March 2000, the first of four single releases from his debut album Hard Rain Don't Last. Following this song were "A Good Day to Run", "Second Wind" and "Sideways". Respectively, these singles peaked at No. 15, No. 12, No. 20 and No. 41 on the Billboard country charts. Production duties on the album were split between Frank Rogers and James Stroud. Also in 2000, George Jones charted with the single "Sinners & Saints", which Worley co-wrote.

I Miss My Friend (2002)
His second album, I Miss My Friend became his first Number One hit on the country charts that year, and was followed by the top 30 "Family Tree", written by Darrell & Scott. This album was also his first Number One album on Top Country Albums.

Have You Forgotten? (2003)
Worley had his biggest hit in 2003 with the 9/11 tribute ballad "Have You Forgotten?", the first release from his 2003 compilation album of the same name. It reached Number One in its fifth week on the charts, and held its position for seven weeks. The album included only four new tracks counting "Have You Forgotten?", as well as six each from his first and second albums. "Tennessee River Run", one of the carryovers from I Miss My Friend, was issued as a single in 2003, peaking at No. 31. After it came his lowest-peaking single, "I Will Hold My Ground" at No. 57. Have You Forgotten? is also certified gold by the RIAA.

Darryl Worley (2004–2005)
2004 saw the release of Worley's third studio album, the self-titled Darryl Worley. Its lead-off single, the Harley Allen co-write "Awful, Beautiful Life", became his third Number One hit in early 2005. Following this song was the Top Ten "If Something Should Happen", as well as "I Love Her, She Hates Me", which stopped at No. 56 due to the closure of DreamWorks Records in mid-2005.

Here and Now (2006–2007)
Later that same year, Worley signed with country singer Neal McCoy's vanity label 903 Music. His first release for 903 was "Nothin' but a Love Thang", which peaked at No. 35. This was the first of three singles from Here and Now, his fourth studio album. Also released from it were the Top 20 "I Just Came Back from a War" and the No. 54 "Livin' in the Here and Now", the chart run of which was halted by the closure of 903 music in May 2007.

Sounds Like Life (2008–2010)
Worley signed in 2008 to his third recording contract, this time with Stroudavarious Records, a label that Stroud founded in 2008. His sixteenth chart entry, "Tequila on Ice", was issued in the middle of that year, peaking at No. 44. Following it was "Sounds Like Life to Me", which has reached the Top 20. Both songs are included on his fifth release, Sounds Like Life. The album's third and final single was "Best of Both Worlds."

God & Country
Worley debuted the single "Keep the Change" in mid-2010. It was to be included on his sixth studio album, God & Country, but the album went unreleased when his record label, Stroudavarious, ceased operation.

Worley then moved to Tenacity Records in 2012 to release "You Still Got It".

Personal life
Worley married his first wife, Beverly Irwin, on May 12, 2001; they divorced in July 2006. Worley opened a restaurant, the Worleybird Cafe, in Savannah, TN, with his first wife. He also has two brothers, Tommy and Barry. Worley has been married since December 2007 to Kimberly Lee Perkins, with whom he has a daughter. Worley also formerly owned a boutique furniture store in Enterprise, Alabama.

In addition, Worley posed nude (non-full frontal) for the July 2007 issue of Playgirl magazine.

Charitable works
Each year, Worley hosts a Charity Foundation Event, which is called the "Tennessee River Run." Proceeds benefit the Darryl Worley Foundation, a not-for-profit organization that provides funds to St. Jude Children's Research Hospital, Le Bonheur Children's Medical Center and the Cystic Fibrosis Foundation. His foundation also funded and helps maintain the Darryl Worley Cancer Treatment Center in his hometown of Savannah, Tennessee and helps area families in need through a grant process.

Discography

 * Studio albums
 * Hard Rain Don't Last (2000)
 * I Miss My Friend (2002)
 * Darryl Worley (2004)
 * Here and Now (2006)
 * Sounds Like Life (2009)

 * Compilation albums
 * Have You Forgotten? (2003)

title: Darryl Worley


text:
Talk:Operation Power Geyser

Evidence of the truthfulness and notability of this article can be found at Votes for deletion/Operation Power Geyser. - Jersyko    talk   19:23, Jun 5, 2005 (UTC)

title: Talk:Operation Power Geyser


text:
User:Mwild

I'm gradually getting the hang of this thing!

title: User:Mwild


text:
Richard N. Cabela

Richard Neil "Dick" Cabela (October 8, 1936 – February 17, 2014) was an American entrepreneur, best known as a co-founder of Cabela's, a leading outfitter of outdoor sporting and recreational goods. He stated that his business was inspired by his bout with polio and a deep love of hunting and fishing. He was also described as "a vocal supporter of the National Rifle Association of America" and a hunter who decorated his home with taxidermic wildlife.

Biography
Born in Chappell, Nebraska, Cabela and his father, who were both of Italian heritage, went to Chicago to purchase items for the family furniture store back home. Initially he placed ads in a local newspaper for "12 hand tied flies for $1". When the items did not sell locally, he advertised them in national newspapers and magazines such as Sports Afield. He and wife, Mary, built a customer base and created a small mimeographed catalog to offer more fishing gear. From 1961, the Cabelas, Dick, his wife Mary, and his brother James, created a catalog business with annual revenues of over US$3 billion, featuring stores in Alaska, Arizona, Colorado, Georgia, Idaho, Illinois, Kansas, Kentucky, Maine, Michigan, Minnesota, Missouri, Montana, Nebraska, Nevada, North Carolina, North Dakota, Oregon, Pennsylvania, South Dakota, Texas, Utah, Washington, West Virginia, and Wisconsin, and shipping goods and 120 million catalogs each year to all 50 states and many foreign nations. Additionally, the business inspired the creation of a financial institution and credit card issuer called the Worlds Foremost Bank.

He died on February 17, 2014, at his home in Sidney, Nebraska, at age 77.

Honors
Cabela was the recipient of several awards over the course of his career. Among the awards Cabela received were the C.J. McElroy award in 2001 from the Safari Club International and the Golden Bullseye Pioneer award from NRA Publications in 2008.

title: Richard N. Cabela


text:
Talk:HMS Lutine (1779)

Untitled
Recently, I bought a book on the flea-market about the Lutine, the treasure and all that. It contains some very interesting stuff about lost dutch crown jewels, some salvaged money and the reasons why the ship herself was never salvaged although an awfull lot of money was on board (or was it??? wink, wink). I hope I can make a huge article about the Lutine with the book's material. But of course, all depends on my spare time.

Russian participation in the 1799 campaign against the French in the Batavian Republic
Someone has changed the Russians into Prussians. Was there a reason for this? See June 22 here or "the British-Russian invasion of 1799", here (RJP 19:19, 30 January 2006 (UTC))
 * I think that it was probably me, in error; see: French Revolutionary Wars: Campaigns of 1799. The reference to the Russians or Prussians is unhelpful; the loss (1799) occurred during the Second Coalition of the French Revolutionary Wars, and this should (I suggest) be the context used to describe the loss (which is what I have done). --Major Bonkers 12:45, 4 April 2006 (UTC)

Altering the heading
I have bought a copy of 'The Lutine Tresure', which appears to be the major reference work on this wreck, and am busy working my way through this article, replacing and correcting as necessary. One thing that I cannot do is alter the title, which gives an incorrect date for the the laying down of the vessel (1785 instead of 1779). Can anyone help?! --Major Bonkers 12:20, 4 April 2006 (UTC)

Worked it out - you use the 'Move' page. --Major Bonkers 10:59, 26 April 2006 (UTC)

The coordinates
These coordinates are plainly wrong, these coordinates list a place in the British mainland, far away from the Netherlands.

 * I think someone made a mistake in entering the number of degrees of easting. By putting 5 instead of 0, I have placed the position somewhere near the right spot but how accurate it is I don't know. (RJP 11:14, 17 July 2006 (UTC))

 * My mistake. The co-ordinates were taken from 'The Lutine Treasure' and, on checking, refer to the Amsterdam meridian as opposed to the Greenwich meridian. Well noticed and thank you for the correction. Incidentally, if you know how to link the position reference, as in certain other Wikipedia articles, please do so! --Major Bonkers 11:01, 25 August 2006 (UTC)

Spelling
I 'corrected' the spelling in the title of Van der Molen's book, then saw that it was consistently 'wrong'. Is 'tresure' someone's local spelling and used in the title of the book? If so, I'll undo my 'correction'. (RJP 11:55, 25 November 2006 (UTC))
 * I suspect some naughty person has been 'correcting' my faultless prose. thank you for changing it.--Major Bonkers 13:12, 5 February 2007 (UTC)

Subrogation
Surely the rights of the Lloyd's underwriters to the gold onboard is down to abandonment (and subsequent salvage) in the event of a total loss not subrogation? I think subrogation is misused here, because the underwriters are not entitled to pursue settlement from a negligent third party in the case of a shipwreck...Littlebex 17:29, 21 January 2007 (UTC)
 * Yes, thank you. Should have spotted it myself.--Major Bonkers 12:36, 6 February 2007 (UTC)

Lloyd's Yacht Club
Is there at the moment a yacht called Lutine? 91.106.47.46 (talk) 10:39, 11 February 2008 (UTC)

Citation needed
I have replaced a few Citation needed in to 1799. As the whole part of it is happening in that verry same year. I will ad some more information soon, As I am working on the dutch version right now. There are a few inconsistancies like the weight, and diameter of the Bell. It is told that it ways 106 pounds, and is 44 cm in diameter, not 46. --Rodejong (talk) 22:27, 30 January 2011 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on HMS Lutine (1779). Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20060324194023/http://www.scribeweekly.com/de%20lutine.htm to http://www.scribeweekly.com/de%20lutine.htm

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 11:00, 27 October 2017 (UTC)

title: Talk:HMS Lutine (1779)


text:
Talk:Multiplication algorithm

Example in Objective Caml
The example given is I'm sure great, but I have no idea what caml is, and it's kinda confusing to read. A C or pseudocode example would convey the meaning of the code far more clearly to the majority of the reader base. Could someone translate the example to C/Pseudocode for us? AdamSebWolf 09:09, 30 May 2006 (UTC)

Article needs attention tag
I've excerpted the following comment made at Pages needing attention/Mathematics concerning this article:
 * The article … contains a false statement: "The fastest known method based on this idea was described in 1971 by Schönhage and Strassen (Schönhage-Strassen algorithm) and has a time complexity of Θ(n ln(n) ln(ln(n)))". (About multiplying long integers - Θ(nln(n)) is evidently enough). The part "A simple improvement to the basic recursive multiplication algorithm..." contains warmup example and shouldn't be in the end. Discussion about complexity is mixed with the discussion about rounding errors and the GIMPS project. (Unsigned entry at 08:06, May 10, 2005 (UTC) by 212.193.10.2. Paul August ☎ 18:54, Jun 5, 2005 (UTC))

Some of the above user's comments may no longer apply because of subsequent edits, but I thought I would copy this here for the editors of this page to consider. Paul August ☎ 19:28, Jun 5, 2005 (UTC)

To be more clear, the commentor above was the same person who added the "article needs attention" msg. So if we think all of that persons issues have been adequately addressed then, we can remove the tag, and it's entry on Pages needing attention/Mathematics. What concerns me most is the alleged factual error. I don't know enough to confirm or fix this. Paul August ☎ 19:48, Jun 5, 2005 (UTC)

In fact the article is correct, the complexity of S-S multiplication is O(n log n log log n), and is the best known. Often FFT multiplication is quoted as having complexity O(n log n), because it is assumed the "double" data type on a computer is sufficiently accurate to perform the convolution (which is almost always true in practice). In fact, when you take into account the number of bits needed of the base data type to guarantee sufficiently small error, FFT multiplication has complexity O(n log^2 n).--Luke Gustafson 07:24, 1 January 2006 (UTC)

After reviewing the article thoroughly I removed the attention tag and removed it from articles needing attention. (I'm a little new to these sorts of procedures so hopefully this was done appropriately.)--Luke Gustafson 07:37, 1 January 2006 (UTC)

Number theoretic transform
Is it correct to say the finite field should have at least characteristic m ? -- Nic Roets 12:24, 21 July 2005 (UTC)

I believe (although I haven't actually seen the NTT algorithm) that the characteristic needs to be larger than possible values of the convolutions-- 2^w+1 I think.--Luke Gustafson 07:31, 1 January 2006 (UTC)

Details can/could be found in Nussbaumer's Fast Fourier Transform and Convolution Algorithms, if anyone has the time to spare. I might double back an add something on NTTs at a later date. Polynomial transforms probably also deserve a mention, I've used them to avoid the rounding error problems mentioned alongside the NTT reference. 118.208.79.170 (talk) 10:47, 6 April 2009 (UTC)

Hardware
Note that it's possible to implement any of these in Combinatorial logic hardware. Is there a reference to show that long multiplication is the dominant implementation in silicon ? -- Nic Roets 12:22, 21 July 2005 (UTC)

Long Multiplication
Seems like a more thorough walkthrough of long multiplication should be given, to parallel the long division article. The example doesn't explain the process at all.

 * Is there a corresponding "short multiplication"? — Omegatron 03:36, 29 November 2005 (UTC)
 * I think the name 'long multiplication' was given to distinguish it from multiplication that uses tricks such as lookup tables -- Nic Roets 11:12, 12 August 2006 (UTC)
 * Should the algorithm be labeled as "fairly accurate"? The algorithm is accurate and will produce a correct answer if used correctly. Any algorithm is subject to operator error -- EconProf86 19:09, 1 July 2007 (UTC)

I think it would be good to add proof of correctness. It is a little strange that everybody learns it but I never encouter proof. It is as simple that number is sum. 123 is 1*10^2+2*10^1+3*10^0. From gemometry we know that field of rectangle with sum (a+b+c)*(d+e+f) is sum of multiplication of each part with another ad+ae+af+bd+be+bf+cd+ce+cf and that is exactly what this algorithm do. — Preceding unsigned comment added by Marekmosiewicz (talk • contribs) 11:45, 24 January 2024 (UTC)

lattice multiplication
the lattice isn't explained very well. it should also be converted into an image, like this: http://online.edfac.unimelb.edu.au/485129/wnproj/multiply/images/lattice4.gif

I started to convert it to table markup, but then saw that the examples on other sites draw diagonal lines. it might be possible to draw it in tex, too? but an image is probably the best method. — Omegatron 03:32, 29 November 2005 (UTC)

Karatsuba
I thought this section could use more references and more in the way of practical application -- what ranges it's efficient in and so forth. Since the section was already too long, I spun this out into its own article: Karatsuba multiplication. As a result, I've shortened the explanation here by making the example less explicit and technical and removing the Objective Caml example (both of which were moved over). CRGreathouse (talk • contribs) 00:13, 12 August 2006 (UTC)

Lower bounds?
Are there proven lower bounds on how long any general multiplication algorithm of n-bit numbrs must take? It's trivially Ω(n), and S-S shows it's O(n log n log log n), but are any better bounds known? CRGreathouse (t | c) 03:42, 22 September 2006 (UTC)

 * I think the article summary should list the lower possible/known bounds. ~ Booya Bazooka 14:46, 17 November 2010 (UTC)

 * Furer's algorithm is asymptotically better than S-S. I'm not aware of any nontrivial lower bounds on serial multiplication - however multiplication is known to lie outside of AC0, meaning it can't be solved with bounded fan-in constant-depth logical circuits, because there is a constant-depth reduction from parity to multiplication, and parity is not in AC0 (see e.g. ). This is the best lower bound I know of, and I will add it. Dcoetzee 23:21, 19 November 2010 (UTC)

FFT
Can someone explain why this is true (in the section regarding FFTs): "We choose the largest integer w that will not cause overflow during the process outlined below. Then we split the two numbers into groups of w bits"?

I haven't messed around with my own examples (and I'm only in high school, so I probably am just missing a point somewhere), but why does it make sense to have the integer w be the size of the groups? Shouldn't the size of w be the size of the groups?

The most watered down example I could come up with to prove this (to myself) is this: Say we want to do FFT multiplication to multiply 6 by 9 (I know this is pointless in actuality, stick with me), the largest integer w that will not cause overflow is 3. The size of 3 in bits is 2, but we are going to group the numbers into 3 bit pieces, with a maximum value for each of 7. Would 7 not cause errors due to overflow?

I just think there's one or two words amiss in the quoted text; but, again, I don't really have a clue what I'm talking about (dd you notice? :D) — KyleP 07:33, 24 February 2007 (UTC)
 * Hi Kyle - the short answer is, w is already a size in bits, not the number of values possible for each group, which would be 2w. I don't quite follow your example but this may be your source of confusion. Dcoetzee 08:37, 7 April 2009 (UTC)

I think there might be a slight mistake in the convolution equations: in the double sum after the 2nd '=' sign k goes from 0 to 2m and i from 0 to k which means we multiply for example a_0 and b_2m while b only have m values. Or am I wrong somewhere? —Preceding unsigned comment added by 46.116.195.141 (talk) 17:16, 14 February 2011 (UTC)
 * Oops, just realized it's defined as 0 later on. sorry. —Preceding unsigned comment added by 46.116.195.141 (talk) 17:18, 14 February 2011 (UTC)

Leonardo
There is reference to a Leonardo but there is no acute way of knowing who Leonardo really is. 129.32.94.123 (talk) 17:43, 19 February 2010 (UTC)
 * Leonardo was the author Fibonacci's first name. Dmcq (talk) 18:19, 19 February 2010 (UTC)

Quarter square multiplication and recurrence relations
I have in mind putting in something about this, but first I thought I should put it up for comment, both to get it debugged and to allay any objections about original research (it isn't original, but I can't remember where I came across it, so I had to redo it - and it does seem obvious once you see it). Read on...PMLawrence (talk) 14:11, 11 March 2011 (UTC)

With qs the quarter square function on integers (rounded down), then because we have $$qs(x+y) - qs(x-y) = xy$$, putting $$x = n-r$$ and $$y = r$$, we get a family of recurrence relations $$qs(n) = qs(n-2r) + nr - r^2$$ for each r. In general this would involve more multiplications, but we can choose r to make those convenient, say powers of 2 so that the multiplications can be done by repeated doubling. Then it is convenient to work out values of qs(n) using a suitable subfamily of the recurrence relations, e.g.:-

qs(n) = \begin{cases} qs(-n) & \text{if }n < 0 \\ 0 & \text{if }n = 0 \\ 0 & \text{if }n = 1 \\ qs(n-2) + n - 1 & \text{if }2 \leqslant n < 4 \text{ (matching }r = 1 \text{)} \\ qs(n-4) + 2n - 4 & \text{if }4 \leqslant n < 8 \text{ (matching }r = 2 \text{)} \\ qs(n-8) + 4n - 16 & \text{if }8 \leqslant n < 16 \text{ (matching }r = 4 \text{)} \\ qs(n-16) + 8n - 64 & \text{if }16 \leqslant n < 32 \text{ (matching }r = 8 \text{)} \\ qs(n-32) + 16n - 256 & \text{if }n \geqslant 32 \text{ (matching }r = 16 \text{)} \end{cases} $$

... or using more or fewer members of the family, or using tabulated values of qs for more than just n = 0 and n = 1. (Clearly, if only the recurrence relation for r = 1 is used, there is no multiplication needed to evaluate qs at all, but then multiplying using qs resembles multiplying using repeated addition. In particular, it is slow for most multiplications.)

 * I really can't see how anyone could ever have got any gain from using this, so I would need to see a citation which also mentioned it helping with multiplication. Dmcq (talk) 14:38, 11 March 2011 (UTC)

 * The gain comes from not needing such a large table as the straight look up method, while still being reasonably fast. Code would typically be a function using a (much smaller) table of number of times to double (doubling by adding) and the amounts to subtract ($$r^2$$), read off against the values of r, highest first, and would drop through looking for the first recurrence relation to use. It would then use n, those values, and a recursive call to get the result. The base case would be a small, direct look up table it would hit if no number were found (just two entries in the example above). Alternatively, even those values could be calculated rather than looked up, which is slightly slower but more flexible. But what does the gain have to do with it, anyway? PMLawrence (talk) 00:04, 12 March 2011 (UTC)

 * The gain has to do with citation in an article about multiplication. I didn't see it gained anything useful so I asked for a citation because it seemed unlikely to me that anyone actually even contemplated using this recurrence in the context of multiplication. It still seems extremely unlikely so yes you definitely need a citation and your assurance you saw it somewhere is not enough. Dmcq (talk) 00:25, 12 March 2011 (UTC)

 * And there I was thinking you were asking what using quarter square multiplication, you know, gained from being evaluated this way - since you did write "I really can't see how anyone could ever have got any gain from using [emphasis added] this". Are you sure you aren't simply shifting your position? But clearly citation isn't necessary for certain levels of discussion, as that section already contains "A simple algebraic proof shows that the discarded remainder would have canceled [sic] when the final difference is taken, so no accuracy is lost by discarding the remainders". So how about "A simple algebraic proof shows that quarter squares can also be evaluated conveniently using recurrence relations", at least to be going on with? If I don't give readers any more useful - i.e. more detailed - information, that will be both true and easily verified, by the standards of the section. Or would you regard that as a challenge to delete that necessary part of the table method, since the cited reference doesn't actually cover that, even though it is necessary for completeness? In any case, it strikes me that providing the level of detail I suggested is obvious once you notice the recurrence relations, and is really only for illustration. I don't see why it should be contentious, since it is so easy to confirm its behaviour (though I put it up here partly so as not to have to debug it myself while I was still so close to it). PMLawrence (talk) 03:00, 12 March 2011 (UTC)
 * The relevance to multiplication hasn't been shown. It is missing a citation. And it is big. There is no good reason to include it and good reasons not to. Dmcq (talk) 08:44, 12 March 2011 (UTC)
 * Huh? The section itself shows the relevance of quarter squares to multiplication, and this is clearly relevant to quarter squares (by the way, when I first heard of quarter square multiplication, it was described as a method the Romans used, with look up tables; with their notation, I wouldn't be surprised if they used the r = 1 recurrence relation to build up their tables rather than actually calculating the entries individually - and that, I freely admit, is the sort of speculation about historical fact that would need a citation to justify going in the section, but I mention it here simply to show that there is nothing prima facie unlikely that people would ever have used recurrence relations to evaluate quarter squares, or prima facie absurd and unhelpful about referring to recurrence relations in this section). You have not addressed my interim suggestion of a brief mention with the same level of citation as a comparable sentence already in there, and you have not addressed the reasons I gave for thinking that a free standing source is not so necessary in this case (i.e., that the level of detail is only for completeness/purposes of illustration and can easily be verified without needing outside references, since the principle is covered by my interim suggestion above - it's not as though verification would need readers to conduct a laboratory experiment or anything like that). While the particular illustration I canvassed above is "big", that's only how it appears on screen with images enabled - it's actually only an ordinary paragraph of notation between two shorter ones that are mostly text; and this current exercise is about seeking constructive criticism, so would you be happy if I suggested a briefer illustration or if you tried your hand at one yourself? And I thought I gave good reasons for including something along these lines, if not precisely the draft above (at any rate, so far you have not addressed the reasons I gave, showing whether they were good or bad and why but only that you did not agree with them - which is no proper test of "good", in this sense), while I have yet to see your reasons, good or otherwise, for not doing so. That is, I have seen your stated conclusions, but no reasons over and above being "big" and a lack of citation, but you can't mean those in your paragraph just there as that would be double counting (that you don't see a gain is not a reason in itself but a statement of your position, a conclusion you have come to). PMLawrence (talk) 11:19, 12 March 2011 (UTC)
 * Just because quarter squares are relevant doesn't mean this recurrence is. Please just follow the WP:5P. We're supposed to find things which are halfway notable written about in reliable sources and summarize what's written about them. You really need a reliable source if you want to take this any further. Dmcq (talk) 23:46, 12 March 2011 (UTC)
 * Again, huh? By that standard, much of what is in this section shouldn't be in there. You have failed to address any of my specific points bringing this out. In particular, you have failed to state any reasons not to go with this, in the sense of specific reasons of the sort I asked for. So, I'll start again. Unless I soon receive specific reasons not to, or constructive criticism suggesting alternatives, in the near future I shall put in an interim entry roughly like this: "A simple algebraic argument shows that quarter squares can also be evaluated using recurrence relations, $$qs(n) = qs(n-2r) + nr - r^2$$. This is fast for large r, and easy when r is a power of 2 as the multiplications of n reduce to doubling by repeated addition and drop out completely in the simplest, slowest case.". I believe only the first sentence is strictly necessary for this matter, and it meets the standards already followed in this section, but the second sentence is necessary to clarify its usefulness. Even so, a fuller illustration would be better, and I would welcome any constructive criticism offering that. PMLawrence (talk) 03:04, 15 March 2011 (UTC)
 * And I'd remove it citing WP:Original research. I do not believe this is a basis for a good algorithm, and I don't believe it has ever been used or written about in this context. Dmcq (talk) 10:04, 15 March 2011 (UTC)
 * You have given a strong indication that you are not acting in good faith. Now that I have provided references - you are claiming that the particular use proves that the material does not belong here. You are inventing objections on the fly rather than carrying out constructive criticism to provide helpful suggestions, you are failing and refusing to provide specific objections so I can see how to address them, and when I meet your general and generic objections you claim - irrelevantly as well as incorrectly - that those links make that material more specific to something else and thus irrelevant here. But not only is that wrong - about it being irrelevant - it misses the point about how encyclopaedias work. If that material were carefully confined in a different article, the article on multiplication would be missing stuff on how that is achieved. I believe I have given plenty of leeway, asked for constructive criticism in advance, met and more than met your stated objections insofar as you have condescended to reveal them, and now been confronted with an objection invented after the fact that was not among any objection given before and is anyway both unfounded and irrelevant. In all the circumstances I feel justified in asking for arbitration, since I have gone out of my way to avoid the necessity without success. Feel free to offer constructive criticism while we wait, if you can bring yourself to it (but note that putting this "how" stuff elsewhere does not help this article). PMLawrence (talk) 03:35, 20 March 2011 (UTC)
 * I would say this is a perfectly adequate section, as long as the references are appropriately set up. I haven't seen this analysis before and wouldn't know where to go to look for it, and until I get the latter I wouldn't be happy about this section going in - but the work itself looks fine. --Matt Westwood 23:07, 20 March 2011 (UTC)
 * The article is about multiplication algorithms. The 'recurrence relations themselves are no more than a dressed up version of (a+b)2=a2+2ab+b2 and hopefully you would have seen an 'analysis' of that somewhere or be able to figure out where to go for it. They are not used in quarter square multiplication. As I have said to the person the references could be used in the mathematical table or human computer article as these are about table construction. However particular methods of table construction do not belong here and the recurrence relations as given here were not used in table construction anyway and have never appeared in the literature as far as I'm aware for any purpose. Dmcq (talk) 08:32, 21 March 2011 (UTC)

Construction of tables
The justification for a section about recursive generation of the quarter suares was that it was used in the table generation.

 * That is absolutely false. The fact is, you asked for a reference showing that recurrence relations were in fact used. I provided more than one relevant citation. However, that is not the justification for mentioning it, that is, the thing that makes it relevant. It is relevant because it shows how to obtain conveniently the things quarter square multiplication uses - the values of the quarter squares. Bluntly, this is not about table construction, it is about quarter square multiplication, and the reference to using this approach to construct tables was solely and simply to satisfy you in your asking for a reference to a real situation in which this approach was used. That does not turn it into something that only matters to table construction, it meets your demand for a demonstration of usefulness. That does not make it useless for anything else; by that Morton's Forkish reasoning, if I don't give you a citation I can't make the edit, and if I do I must not make the edit. PMLawrence (talk) 03:35, 20 March 2011 (UTC)

The method was a standard one in the pre-computer era. It doesn't have anything to do with multiplication as such so I removed it.

 * By that logic, most of that section should be removed. However, as I have just pointed out, it is indeed relevant to multiplication because it shows how to obtain conveniently the things quarter square multiplication uses - the values of the quarter squares. If you don't believe me, read Samuel Laundy's own words in a report to the Institute of Actuaries, in their magazine I cited: "THE paper which I have the honour to submit is so elementary in its details that I have to claim the indulgence of the meeting; but, as the practical application of the simple formulæ to which I shall have occasion to refer may be interesting, I trust I may not unworthily occupy a short portion of your time. A few months ago it occurred to me that tables to facilitate the process of multiplication, based upon the identity would be of extensive use in actuarial and other calculations, and would effect a considerable saving of labour—to an extent even greater than that acquired by the use of logarithms... Before proceeding to explain the use of the tables, I may be allowed to refer to the process by which they have been computed. To form each value separately by multiplication would require an amount of labour that few would voluntarily undergo : but considering the fact that the squares of numbers beginning from unity may be found by the successive addition of a constantly and uniformly increasing difference, it is evident that every tabular number may be found from that preceding it by the process of addition... But the computation from No. (2000) and onward can be more conveniently continued by a modification of the above method..." Mr. Laundy, himself, pointed out the relevance of the method of construction, and the Institute of Actuaries was willing to accept that in the report. PMLawrence (talk) 03:35, 20 March 2011 (UTC)

A bit more in the article human computer about how they were used to compute tables would be useful I think.

 * While that would help that article, it fails to help this one, which would - as I have shown - benefit from the presence of material in this area. PMLawrence (talk) 03:35, 20 March 2011 (UTC)

It should be based on what's written about how to divide up the work between multiple computers. The method here is a slight variation on what a difference engine normally does and could be done by one by having two extra digits which are ignored and of course they worked in decimal. Dmcq (talk) 14:22, 19 March 2011 (UTC)

 * Please do not split up peoples contributions this way. You are not replying to an email. You can quote a bit of what a person says if it is not obvious from your reply.
 * If you can point to other parts of this article which are not directly pertinent to multiplication algorithms please do so.
 * Computing the quarter squares is no problem. You just square, divide by four and discard te remainder as explained in the article. What was being described by Samuel Laundy was the standard technique to generate tables and is relevant to human computer or mathematical table. It isn't relevant here. And sticking in your own formula and saying Laundy used a variant of it isn't exactly following WP:Reliable sources either is it?
 * I guess from what you are saying you don't feel like trying to improve human computer or mathematical table and want to continue here instead. I have said my piece a couple of times and doubt saying it again is a terribly useful occupation so I shall raise this at Wikipedia talk:WikiProject Mathematics. Dmcq (talk) 13:07, 20 March 2011 (UTC)

Linear time multiplication
I think there is an error in the section "Linear time multiplication". In the reference, Knuth discusses that in the model described in this article, multiplication can be done in O(n log n), not O(n). After that he leaves as an exercise to prove that in the pointer machine model it can be done in O(n). — Preceding unsigned comment added by 181.28.64.87 (talk) 04:15, 28 August 2012 (UTC)

Cheprasov Algorithm
There seems to be some edit warring about this. Please discuss on this talk page first if still insistent on including it.

Personally I see no reason to include it at present. There does not seem to be any general interest that I can see. Also if there was some interest I believe mental calculation would eb more appropriate.

As to the actual system as described personally I think it is silly. I can make up better myself in a couple of minutes, for instance using the symbolism there

 * $$A= (t_1-u_1)\times(u_2-t_2)$$
 * $$B=t_1\times t_2$$
 * $$C=(u_1 \times u_2) + t_{u_1 \times u_2}$$
 * $$D= (A+B+C)$$@$$u_{u_1 \times u_2}$$
 * $$\operatorname{Answer} = (B+\operatorname{hundreds of} D)$$@$$\operatorname{tens and units of} D$$

Which also possibly has negative numbers and adds up to something positive. I don't specially feel inclined to write a book about that though. Dmcq (talk) 12:02, 4 January 2013 (UTC)
 * I agree with Dmcq. One can remark that the algorithm presented by Dmcq is well known (up some changes of signs) as Karatsuba algorithm, and has the great advantage to use only 3 multiplications of digits instead of 4 in the classical algorithm and in the so called "Cheprasov Algorithm". D.Lazard (talk) 12:53, 4 January 2013 (UTC)
 * Yes, the proposed algorithm has no particular advantages in time complexity or for mental calculation, which is precisely why it hasn't gotten published in any peer-reviewed venue. Dcoetzee 05:56, 5 January 2013 (UTC)

justification for taking remainders in quarter squaring
IMO the explanation
 * If x+y is odd then x-y will also be odd, this means any fraction will cancel out so no accuracy is lost by discarding the remainders.

is not valid as it stands. It is not immediately obvious (without "writing out" (2n-1)²=4n²-4n+1) that the remainders could not add up their effects rather than cancel out; at least the argumentation much be changed. I'd rather suggest
 * We know that the result is an integer, so any possible fractional part of +/- 1/4 in either (x+y)²/4 or (x-y)²/4 (in case the squares are of the form (2n+1)²=4n²+4n+1) must necessarily cancel.

This argumentation leads (IMO) more obviously to the correct result. — MFH:Talk 14:40, 19 March 2013 (UTC)
 * The statement is true. You never get a -1/4 remainder when squaring. It isn't a textbook and checking is fairly easy for a reader if they want to do so. Dmcq (talk) 18:01, 19 March 2013 (UTC)

A possible memory trade for time gaining 4 the common O(N*N) multiplications
i think there is a chance that purely creative paradigm approaching way of 1->K data length extrapolation could lead us to an algo that is derived from common algo O(N*N) n that is kinda trading memory O(N) complexity 4 an Sqrt(N) time factor demultiplied from N*N time complexity. Take this as a challange... it looks to me that idea can not b (at least not easily) extrapolated for recursivity so better algo using this only suggested idea seems harder to b obtained. Good Luck, Yankees !! Florin Matei, Romania. 93.118.212.93 (talk) 14:15, 5 May 2013 (UTC)

ok, purely creative part 4 finding similarities with quicksort paradigm
qsort might use small sorting in order to partitionate the datas practically forcing some D&C solution, i wonder if there is a similary idea 4 multiplyings: heres the pure creative aproach: we got a rectangle we know the lengths of the edges but we dont know its surface (probably surface area) we might use some both sides splitting in such a way that we might b forming a square or...(a more "docile" rectangle) ... the formed square might help as using algebra taking advantages of its equals borders... its not quite easy to get this to an end but, again, it might worth a try. Florin Matei, Romania... 93.118.212.93 (talk) 17:16, 13 June 2013 (UTC)
 * I don't understand what you are saying. I think you are proposing some of your own ideas. We only put things into articles which have been written about in books and magazines and suchlike and not editors own ideas. See WP:Verifiability. Dmcq (talk) 18:36, 13 June 2013 (UTC)

wow: thats a cold war specialist talking, but i agree u got some of ur own policy: we got ours, too bad my ideas r working ha?93.118.212.93 (talk) 20:36, 13 June 2013 (UTC)

take these a a homework, please, y not some credits 4 me anyway?

n*log(n) muls or even better

wow, im sorry lets say we want to multiply a1 n b1, to avoid confusion a1*b1=m*m-n*n; m*m =(m1;m2)*(m1;m2), m1 the most significant part m1=3*a+b, m2=3*b+a, computing m1*m1, m2*m2 n m1*m2 from "autosolve". good luck n dont forget credits, ok?? Florin Matei, Romania 93.118.212.93 (talk) 19:16, 6 December 2012 (UTC)

What exactly are you trying to say? What is "autosolve"? The idea to reduce multiplication to two squarings is old. How is 3a+b the most significant part of m? What is m? Usually one would take m=(a+b)/2 and n=(a-b)/2. m=3a+b would require n=3a-b to cancel the squares, then m*m-n*n=12*a*b. How do you propose to achieve the squarings? Using Karatsuba? Do you resolve the mixed scale multiplication again to a difference of two squares? What is the complexity relation, that is, how is T(2n) expressed in terms of n and T(n)? n*log(n)-Multiplication is Schönhage-Strassen, an algebraic variant of the FFT. Did you check that?--LutzL (talk) 12:35, 7 December 2012 (UTC)

Please study Daniel J. Bernstein: Multidigit multiplication for mathematicians. for an overview of fast multiplication algorithms and ways to communicate them. If the formalism is right, the language doesn't matter that much.--LutzL (talk) 20:16, 19 December 2012 (UTC)

autosolve in a nonexpansive way to compute m1*m2 using the notations m1=3a+b n m2=3b+a, m1, m2 the 2 parts of spilting m (whos m? dont make me laught, u is the one to say idea is old), n the computed values m1*m1 n m2*m2 that works recursively, dont need extra ideas... once we got m1*m1, m2*m2 n M1*m2 we've completed the curent recursivity level by computing m*m... idea is to use a decent sum m1*m1+r*m2*m2 with the notation suggested in order to find m1*m2 (algo main idea) i know its a bit crazy but might evn work n if so then Order is n*log(n)... n dont bother me with master method formulas i practically reinvented it once n way to verify it also :P 93.118.212.93 (talk) 14:47, 2 February 2013 (UTC)

Please publish a paper, preferably refereed, where you give a detailed description of what happens when in your algorithm, some example and also a detailed account of your reinvention of the "master theorem". But even then this discussion page is not the right place to talk about this fundamentally different "idea".--LutzL (talk) 20:32, 5 February 2013 (UTC)

idk abt the rite place 4 this, apparently is all i can afford it here, not to mention the brain treat... they r doing this 2 me 4 their fun, i guess 93.118.212.93 (talk) 09:29, 9 February 2013 (UTC) Karatsuba idea n estimating MSb mantissa for factorials

i think due to the arithmetic progression of operands n using binary codifyings 4 numbers we could use ideas similary to Karatsuba to multiply in polynomial time a great deal of numbers such as factorials, only for the significant mantissa (n exponent) the details r let to u :) — Preceding unsigned comment added by 93.118.212.93 (talk) 11:53, 2 February 2013 (UTC)

estimating modulus of such product could b possible, anyway, in order for primality tests, but i think i m not able to do that one, not in polynomial time, anyway 93.118.212.93 (talk) 12:00, 2 February 2013 (UTC)
 * Please stop copying stuff into different talk pages. You have been told what is needed. What you are doing is wasting your time and anybody's who reads this. Please stop. Also if you cannot be bothered to try and write understandably and correctly others will not bother trying to make out what you say. Your time is not worth more than mine. Dmcq (talk) 21:20, 13 June 2013 (UTC)

Who was it above who wrote: "wow, im sorry lets say we want to multiply a1 n b1, to avoid confusion a1*b1=m*m-n*n;" ??? You write "a1 n b1" which actually CREATES confusion, because: 1) That includes the letter n so it looks as if you're multiplying a1 * n * b1 2) You go on to use the letter n in the very next equation

Do you think you could write in NON-CONFUSING English, please? "Let's say we want to multiply a1 and b1 ..." or "Let's say we want to multiply a1 by b1..." 46.64.255.189 (talk) 19:58, 10 January 2014 (UTC)

Ancient Indian algorithm for multiplying numbers close to a round number
What is the complexity of this algorithm? 31.42.233.14 (talk) 15:08, 10 January 2014 (UTC) Like, really unbelievably complex, man! 46.64.255.189 (talk) 19:59, 10 January 2014 (UTC)

Peasant Multiplication
It is necessary to say that only one column is added. If this is not specified, the reader will follow the recipe "add numbers which are not scratched out" and that is most of them, i.e. 7 of them in the example of 11 x 3.

It is also necessary to say that it is the column of numbers formed by doubling which is added. Adding the OTHER column will give garbage. If this is not specified, the reader will not know which column should be added.

Neither of the above is obvious from just an example. 46.64.255.189 (talk) 22:45, 10 January 2014 (UTC)

Try looking up "Egyptian multiplication" on wikipedia. You'll find the same method is described. Is there a case for merging or cross-linking them? More fundamentally, we could use "multiplication algorithm" for something which is usually done by computer, and "multiplication method" for something which is normally done by hand. 132.244.72.6 (talk) 15:22, 6 February 2014 (UTC)

The above is correct. One has to say that the DOUBLING column is added. The article DOES NOT SAY that only one column is added. It just says "the numbers are added" which gives garbage. Why can't you bring yourself to just say ADD THE CORRECT COLUMN, DAMMIT!!! ? 132.244.72.6 (talk) 15:22, 6 February 2014 (UTC)

The article just says "All not-scratched-out values are summed" which is WRONG. What it ought to say is "all non-scratched-out numbers IN THE DOUBLING COLUMN are summed". 132.244.72.6 (talk) 15:24, 6 February 2014 (UTC)

The single source used to explain that Peasant Multiplication has been used 'widely' in Russia is unreliable. It itself claims that the history of its name is "unexpectedly murky", and that it may have egyptian roots. It also cites text that no longer exists from another wikipedia page. The passage also claims that it is the *same* algorithm as Egyptian multiplication, which isn't true; the Egyptian Multiplication article has a separate section dedicated to Peasant Multiplication. I believe it would be best to remove this section for now, as it requires heavy modification in its current state. BOOT9989 (talk) 03:26, 1 December 2022 (UTC)

Multiply by averaging
' Method developed by albert_redditt@yahoo.com

' Written in FreeBasic for Windows http://www.freebasic.net

' best to use FBIDE and copy and paste and press F5

' First we set up r_botom and l_bottom

' Then we double those two numbers for r_top and l_top

' then we average each side.

' If l_avg is higher than num2 then we set l_top to l_avg and r_top to r_avg

' if l_avg is lower than num2 then we set l_bottom to l_avg and r_bottom to r_avg ' eventually l_top and l_bottom are straddling num2 and l_avg = num2

' at this point r_avg = multplied answer

' if you divide (l_top / num2) the answer is the same as (r_top / mul answer)

' do   dim as ulongint num1 = int(rnd*1e7) dim as ulongint num2 = int(rnd*1e7) if num2 > num1 then swap num1, num2

'===============================================================================   'during averaging, 'if the l_avg ends in .5 then we add .5 to it and 'the point_5 var (half of num1 ) to the r_avg dim as double point_5 = num1/2 dim as string str1 = str(num1) dim as string str2 = str(num2) dim as double l_bottom, l_avg , l_top dim as double r_bottom, r_avg , r_top '===============================================================================   'r_bottom = num1* leftmost digit of num2 + zero padding to make it the right length r_bottom = val(str( val(str1) * (val(left(str2,1))) ) + string(len(str2)-1,"0")) r_avg = r_bottom r_top = r_bottom + r_bottom '===============================================================================   'l_bottom = left most digit of num2 + zero padding to make it right length l_bottom = val( str(val(left(str2,1))) + string( len(str2)-1,"0") ) l_avg = l_bottom l_top = l_bottom + l_bottom '===============================================================================   'for each unit on the left side there's a num1 on the right side 'So if l_top minus l_bottom = 1000 units, then 'r_top minus r_bottom = (1000 * num1) units.. dim as ulongint count = 0 do       count = count + 1 l_avg = (l_top + l_bottom) / 2 r_avg = (r_top + r_bottom) / 2 if l_avg = num2 then exit do       if right(str(l_avg),2) = ".5" then l_avg = l_avg + .5 r_avg = r_avg + point_5 end if       if l_avg = num2 then exit do        if l_avg > num2 then l_top = l_avg r_top = r_avg elseif l_avg < num2 then l_bottom = l_avg r_bottom = r_avg end if   loop until l_avg = num2 print locate ,1 : print "loop req = " ; count locate ,1 : print "n1       = " ; num1 locate ,1 : print "n2       = " ; num2 locate ,1 : print "l_avg   = " ; l_avg locate ,1 : print "r_avg   = " ; r_avg locate ,1 : print "n1 * n2  = " ; num1*num2 print print "Press a key to continue.." sleep

loop until inkey = chr(27) sleep end '===============================================================================

Method takes aprox 3.3 averages per digit, so 10,000 x 10,000 digits = 33,000 averages — Preceding unsigned comment added by Albert redditt (talk • contribs) 21:03, 18 February 2014 (UTC)

 * This method appears to be original research, being developed by the author of the post and not published in any reliable journal. As such Wikipedia policy is to forbid the insertion of the method in any article. Sorry, Wikipedia is not a media for publishing your work. D.Lazard (talk) 22:08, 18 February 2014 (UTC)

Quarter Square on the CP-1600 (Intellivision)
Inspired by the article here, I implemented quarter-square multiplication for the old school CP-1600 processor family, used in the Intellivision. I implemented unsigned 8-bit × unsigned 8-bit => unsigned 16-bit, 16-bit × 16-bit => 16-bit (signed/unsigned doesn't matter), and a funky fixed point implementation that did signed 8.8 × signed 8.8, where the RHS was constrained to the range -1.00 to 1.00. You can read all about it here: http://atariage.com/forums/topic/236848-quarter-square-multiplication-blindingly-fast-multiplies/ Mr z (talk) 05:13, 15 April 2015 (UTC)

Grid method citation
A user said the first line of the Grid method
 * The grid method (or box method) is an introductory method for multiple-digit multiplication that is often taught to pupils at primary school or elementary school level. It has been a standard part of the national primary-school mathematics curriculum in England and Wales since the late 1990s.

where

then

becomes

which is much faster versus simple single instruction multiplication and in small loops frequently executes in one or less CPU clock cycles since there isn't much math involved with the low overhead SHIFT and OR operations. In many applications, small integers get multiplied repeatedly which is unnecessary stalling since small read only tables fit in the CPU memory caches which are faster.

Essentially, the fastest math operations are the ones you don't do, or only do once.

Youjaes (talk) 06:00, 13 November 2019 (UTC)

Multiplication Algorithm Based on Collatz Function
I'm not sure if it's notable, but a new multiplication algorithm based on Collatz's function has emerged:

 * https://rdcu.be/b4c3M

--DaBler (talk) 08:15, 16 May 2020 (UTC)
 * For being notable, it must be mentioned in secondary sources. This is not the case here, as it is very recent original research. So, at time, not suitable for WP. D.Lazard (talk) 08:23, 16 May 2020 (UTC)

N÷(1÷M)
N×M multiplication can be done in terms of calculating N÷(1÷M). 2A01:119F:253:7000:694A:A3D8:66A5:C4B2 (talk) 11:52, 28 January 2022 (UTC)

Merger proposal
I propose merging Fürer's algorithm into Multiplication algorithm. This article was created when Fürer's algorithm had the best asymptotic runtime for multiplication, but this hasn't been the case for some time, and now I don't think it's very significant. A similar situation happened with Coppersmith–Winograd algorithm, which I ended up merging into Matrix multiplication algorithm (and later split into Computational complexity of matrix multiplication.) (In fact, arguably, Coppersmith–Winograd is more significant to the matrix multiplication literature than Fürer's is to integer multiplication.)

Most of the Fürer's algorithm article is devoted to other, faster algorithms for multiplication, so it makes sense to dissolve it into the section on that here. Another option would be to make a separate article Computational complexity of multiplication or something similar. Fawly (talk) 21:30, 28 February 2022 (UTC)

 * "Most of the Fürer's algorithm article is devoted to other" That is what is needed to be changed. Algorithm described since source code is available. 2A00:1370:8184:164:389D:FB46:1A30:ED39 (talk) 08:14, 30 March 2022 (UTC)
 * My argument is not about the state of the article exactly, but that the topic is not notable enough for its own article. I don't know what the notability guidelines are for algorithms, but Fürer's algorithm does not have the press coverage or significance in the literature that the Schönhage–Strassen algorithm or the algorithm of Harvey and van der Hoeven has. So, I think a merge is appropriate.
 * Adding more content to the article would not change this. It might not even be desirable, since what one would have to add to distinguish it from other FFT algorithms would likely be overly technical. Fawly (talk) 18:56, 30 March 2022 (UTC)
 * Merge It seems to me that Fürer's algorithm is best appreciated as a step along the way of finding multiplication algorithms with good asymptotic runtime, and therefore it is most useful for the reader to see it in context. If and when the target section outgrows its current article one could consider a split, but a substantial section on asymptotically performant algorithms should be due weight in an article expressly on multiplication algorithms. Felix QW (talk) 11:25, 1 April 2022 (UTC)

x, *
Please change all instances of * and the letter x used as multiplication operators to ×, except in the computers section.|Please remove excess vertical whitespace in the computers section. — Preceding unsigned comment added by 109.70.40.55 (talk)
 * Semi-protection-unlocked.svg Not done: According to the page's protection level you should be able to edit the page yourself. If you seem to be unable to, please reopen the request with further details. ‑‑ El Hef  ( Meep? ) 20:26, 9 April 2022 (UTC)

Lattice multiplication inconsistency
In the lattice multiplication section of this article, it is claimed that the first known appearance of the lattice method in Europe was in a book of Fibonacci, and that in Arab mathematics, the first known appearance of the method is due to Al-Khawarizmi.

However, the history section of the article on lattice multiplication says that this is totally false and that neither of the two authors mentioned the lattice method in his book.

As such, there are contradictory statements in two different articles on the same topic. Someone should look into the sources and see which one is correct (I might get around to it once I have more time but no guarantee) المبتدئ18 (talk) 20:35, 21 November 2023 (UTC)

title: Talk:Multiplication algorithm


text:
Dennis Kozlowski

Leo Dennis Kozlowski (born November 16, 1946) is a former CEO of Tyco International, convicted in 2005 of crimes related to his receipt of $81 million in unauthorized bonuses, the purchase of art for $14.725 million and the payment by Tyco of a $20 million investment banking fee to Frank Walsh, a former Tyco director.

He served more than six and a half years in New York state prisons, and was released in 2014. Separately, Tyco filed suit against Kozlowski and prevailed, with the court finding that the $500 million in compensation and benefits he received during his time of disloyalty, between 1997 and 2002, were forfeited back to the company under New York's "faithless servant" doctrine.

Early life
Kozlowski was born in Newark, New Jersey. His mother, Agnes (née Kozell), worked for the Newark Police Department and as a school crossing guard, and his father, Leo Kelly Kozlowski, worked for the Public Service Transport. His parents were second-generation Polish-Americans. Kozlowski attended Seton Hall University, a Catholic university.

Tyco International
Kozlowski joined Tyco in 1975, becoming CEO in 1992. With Kozlowski at the helm, Tyco massively expanded during the late 1990s.

In 1999, Tyco began shifting the company's headquarters operations from Exeter, New Hampshire, to Boca Raton, Florida, where Kozlowski had a home. At one point, 1,650 Tyco employees were based in Boca Raton.

Although Kozlowski was one of America's highest-paid executives, Tyco spent millions to benefit him, financing personal extravagances and secretly forgiving loans.

The company consistently beat Wall Street's expectations and through a series of strategic mergers and acquisitions, ushered in a new era of mega-conglomerates. Kozlowski left Tyco in 2002, amid a controversy in regard to his compensation package.

Scandal, trial, and conviction
Kozlowski was tried twice. The first attempt was a ruled mistrial when one of the jurors was threatened by the public after being reported to have made an OK sign towards Kozlowski's lawyers. Kozlowski testified on his own behalf during the second trial, stating that his pay package was "confusing" and "almost embarrassingly big," but that he never committed a crime as the company's top executive.

Along with former Tyco chief financial officer Mark Swartz, Kozlowski was convicted on June 17, 2005 of crimes related to his receipt of $81 million in purportedly unauthorized bonuses, the purchase of art for $14.725 million and the payment by Tyco of a $20 million investment banking fee to Frank Walsh, a former Tyco director. On September 19, 2005 he was sentenced by Judge Michael Obus of the Manhattan Supreme Court to serve from eight years and four months to twenty-five years in prison for his role in the scandal. In addition, Kozlowski and Swartz were ordered to pay a total of $134 million in restitution. Kozlowski was further fined $70 million, while Swartz was fined $35 million. Both were convicted on 22 counts of grand larceny, falsifying business records, securities fraud and conspiracy. His aggregate minimum sentence was set at 8 years and 4 months, and his aggregate maximum sentence was 25 years. In 2009, the U.S. Supreme Court declined to hear Kozlowski's appeal.

During his six and a half years in prison, Kozlowski served time at the Mid-State Correctional Facility in Marcy, New York, and then the Lincoln Correctional Facility in New York City. While in prison, he met other high-profile convicts, including Ja Rule and Alan G. Hevesi.

In April 2012, the parole board denied Kozlowski's request for discretionary release. He was granted work release in 2012, and after a parole hearing, he was conditionally released on January 17, 2014. His parole ended in 2015.

Tyco sued Kozlowski, asserting that the $500 million in compensation and benefits he received during his time of disloyalty, between 1997 and 2002, were forfeit under New York's "faithless servant" doctrine. In 2010, Judge Thomas Griesa concluded that under the faithless servant doctrine, Kozlowski must forfeit all compensation and benefits he earned during his period of disloyalty.

Post-prison life
Kozlowski ultimately paid $167 million in restitution and fines, evaporating almost all of his wealth. In 2015, following his release, Kozlowski lived in a two-bedroom apartment in the East Side of Manhattan with his third wife, Kimberly. The couple had a passing acquaintance in the 1990s, and reconnected in prison after she wrote him. After exchanging letters, she visited him in prison; they married after his release.

Commenting on his trial
In 2009, before his trial, Kozlowski asserted his innocence by stating, saying "I am absolutely not guilty of the charges. There was no criminal intent here. Nothing was hidden." After his conviction, but before his appeal was complete, he again denied his guilt, saying that the jury had found him guilty simply on the basis of his huge salary. In a 2013 parole hearing, Kozlowski admitted his culpability, saying, "It was greed, pure and simple. ... I feel horrible ... I can't say how sorry I am and how deeply I regret my actions."

Personal life
Kozlowski has been married three times, and has grandchildren. Kozlowski became notorious for his extravagant lifestyle, supported by the booming stock market of the late 1990s and early 2000s; allegedly, he had Tyco pay for his $30 million New York City apartment which included $6,000 shower curtains and $15,000 "dog umbrella stands".

Tyco paid $1 million (half of the $2 million bill) for the 40th birthday party of Kozlowski's second wife, Karen Mayo Kozlowski. The extravagant party, held on the Italian island of Sardinia, featured an ice sculpture of Michelangelo's David urinating Stolichnaya vodka and a private concert by Jimmy Buffett. In a camcorder video, Dennis Kozlowski states that this party will bring out a Tyco core competency – the ability to party hard. Subsequently, this shareholder meeting/birthday party became known as the Tyco Roman Orgy.

Dennis married Karen Mayo in Antigua in May 2001; they maintained a mansion in Boca Raton. She filed for divorce in Palm Beach County, Florida, in July 2006, a few months after he was sentenced to prison. A divorce settlement was reached in 2008.

In the 1990s, Kozlowski purchased an oceanfront estate in the Squam area of Nantucket island for $5 million. While in prison, he sold the mansion to pay fines and restitution, listing the property for $23 million in June 2006.

Kozlowski was a donor to Middlebury College, where his two daughters attended; he joined the college's board of trustees in 1999, and resigned from the board in 2002, after the scandal emerged. He also was head of the board of trustees of Berwick Academy in South Berwick, Maine, after his daughters had graduated from the school.

title: Dennis Kozlowski


text:
Category:University of California, Los Angeles

 * University of California, Los Angeles − UCLA — located in the Westwood neighborhood of Los Angeles, California.


text: User talk:70.19.72.75

title: User talk:70.19.72.75