Click here to Skip to main content
15,884,986 members
Everything / Algebra

Algebra

algebra

Great Reads

by Member 4201813
Jump forward/backward procedures for XorShift RNG explained step by step
by InvisibleMedia
How to find an F equation that will give you the only successor (minimum distance) of a given number detected in the list of numbers
by Bhairav Thakkar
A robust framework for complete implementation of Finite Element Analysis in VB.NET
by Sander Rossel
An introduction to algebra and algebra of sets.

Latest Articles

by InvisibleMedia
How to find an F equation that will give you the only successor (minimum distance) of a given number detected in the list of numbers
by Member 4201813
Jump forward/backward procedures for XorShift RNG explained step by step
by Bhairav Thakkar
A robust framework for complete implementation of Finite Element Analysis in VB.NET
by InvisibleMedia
An algorithm for sorting integers with a complexity less than O(n log (n))

All Articles

Sort by Score

Algebra 

24 Apr 2020 by Member 4201813
Jump forward/backward procedures for XorShift RNG explained step by step
19 Jul 2016 by OriginalGriff
We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.Try it yourself, you may find it...
25 Apr 2021 by Patrice T
I suspect an error in 𝑝𝑟𝑜𝑐𝑒𝑑𝑢𝑟𝑒 𝑀𝑎𝑡𝐸𝑙𝑒𝑚𝑒𝑛𝑡𝑠𝑆𝑢𝑚(𝐴[0 … 𝑛 − 1,0, … . 𝑚 − 1]) 𝑠𝑢𝑚 = 0; 𝑓𝑜𝑟 𝑖 = 0 𝑡𝑜 𝑛 − 1 𝑑𝑜 𝑓𝑜𝑟 𝑗 = 0 𝑡𝑜 𝑚 − 1 𝑑𝑜 𝑠𝑢𝑚 = 𝑠𝑢𝑚 + 𝐴[𝑖] // I would have expected A[i,j] 𝑒𝑛𝑑...
10 Apr 2016 by Member 12450764
I am trying to make a java program which takes a formula as input and gives all the alternative form for writing that formula. Example-Input(String)- v^2=u^2+2*a*s Output(String)-u^2=v^2-2*a*s a=(v^2-u^2)/2*s ...
10 Apr 2016 by CPallini
Symbolic computation is a quite large and complex argument, I suggest you to start with the related Wikipedia's page: "Symbolic computation - Wikipedia, the free encyclopedia"[^].
30 Oct 2016 by OriginalGriff
We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.Try it yourself, you may find it...
29 Jan 2017 by Richard MacCutchan
Eratosthenes/Sundaram/Atkins Sieve Implementation in C#[^].
24 Oct 2022 by InvisibleMedia
How to find an F equation that will give you the only successor (minimum distance) of a given number detected in the list of numbers
11 Mar 2021 by Marcus Neves
Here in C# ... public static List Bulge2IJ(double X1, double Y1, double X2, double Y2, double Bulge, Config config) { double C = 0; //lunghezza della corda - length of the cord double H = 0;...
19 Apr 2021 by OriginalGriff
We are more than willing to help those that are stuck: but that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us...
6 Jul 2023 by Ronald Veldman
I am writing an application in VB.net to convert a DXF file to GCode for my GRBL laser. I know there are many free or low cost programs out there, but I want this program to work in a very specific way (for too many reasons to explain here). I have been working on this program for about 6...
4 Oct 2017 by Bhairav Thakkar
A robust framework for complete implementation of Finite Element Analysis in VB.NET
16 Nov 2015 by Sander Rossel
An introduction to algebra and algebra of sets.
18 Dec 2016 by OriginalGriff
We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.So have a go, do some research, do...
19 Apr 2021 by CPallini
Consider algorithm 1: there is a statement executed (m*n) times, namely 𝑠𝑢𝑚 = 𝑠𝑢𝑚 + 𝐴[𝑖] Other statements are executed once (e.g. 𝑠𝑢𝑚 = 0;), so, for big values of n and m, their contribution is negligible. Therefore you may write...
29 Jan 2017 by Patrice T
Quote:its possible to run Sieve Of Eratosthenes without start 1?What about running normal Eratosthenes sieve and then remove unwanted answers ?Eratosthenes sieve is an algorithm made to start from the beginning, you can't start is at an arbitrary value.
22 Jul 2017 by InvisibleMedia
An algorithm for sorting integers with a complexity less than O(n log (n))
29 Jan 2017 by OriginalGriff
Yes. You can start it with 2.Other than that, how many times do we have to tell you that we do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you...
25 Apr 2021 by Irfan Ullah 2021
Hello All, Thanks for participation and your precious suggestions, I have done some of the algorithms but I stuck in these two, Could you (experts) find time complexity for the following two algorithm with explanation (steps) so I can solve the...
19 Dec 2016 by AndreTrollip
I have a 2D matrix of heights representing a "floor".The floor consists of equally sized, axis-aligned, rectangles, parallel to the XY plane, at different heights (z). I represent the floor with a 2D Matrix (Matrix[x, y]), such that each reactangle's z is the element in the matrix at x, y....
29 Jan 2017 by Member 12972266
ThinkI dont need a code!its not a homework.if everyone tells homework.... he(she)is a silly!!!!!!its possible to run Sieve Of Eratosthenes without start 1?This is a Mathematical Question!!!!What I have tried:its possible to run Sieve Of Eratosthenes without start 1?